Parallel computer system, method of controlling parallel computer system, and recording medium

ABSTRACT

A management device includes: a memory; and a processor coupled to the memory. The processor executes a process including: storing therein an assignment table including first assignment information indicating whether a job is assigned to the information processing devices and second assignment information indicating that a job is constantly assigned to virtual information processing devices arranged at ends of a connection relation of the information processing devices; searching regions in which idle information processing devices assigned with no job are arranged continuously, using the assignment table stored at the storing; specifying a region appropriate for assignment of a job as an assignment target among the regions searched by the searching; and assigning the job as the assignment target to the region specified by the specifying.

CROSS-REFERENCE TO RELATED APPLICATION

This application is a continuation of application Ser. No. 14/321,861,filed Jul. 2, 2014, which is based upon and claims the benefit ofpriority of the prior Japanese Patent Application No. 2013-168743, filedon Aug. 14, 2013, the entire contents of which are incorporated hereinby reference.

FIELD

The embodiments discussed herein are related to a parallel computersystem, a control program for a management device, and a method ofcontrolling the parallel computer system.

BACKGROUND

Conventionally known are parallel computer systems that connectcomputing nodes having an adjacent relation in an arbitrary-dimensionalspace with two-dimensional mesh connection, three-dimensional cubeconnection, torus connection, or the like, and cause another computingnode located in a path to relay communication between computing nodeshaving no adjacent relation.

In the parallel computer systems, when one job is assigned to computingnodes that are not arranged continuously, a computing node assigned withanother job relays communication between the computing nodes to whichthe job is assigned in some cases. In such a case, when thecommunication between the computing nodes to which the job is assignedcauses disturbance for the computing node assigned with another job orabnormality is generated on the computing nodes that execute the job,another job is interrupted in some cases.

To address this, when the parallel computer system assigns a new job, itsearches all regions in which idle nodes assigned with no job arecontinuous and selects an optimum region for execution of the job fromthe search regions. The parallel computer system then assigns the newjob to the selected region.

The following describes an example of processing of searching all theregions as job assignment targets that is performed by the parallelcomputer system. In the following description, it is assumed that theparallel computer system has a two-dimensional mesh network in whichfour computing nodes are arranged in the X axial direction and threecomputing nodes are arranged in the Y axial direction and the adjacentcomputing nodes are connected.

For example, the parallel computer system selects one computing node andsearches for the number of idle nodes continuous from the selectedcomputing node in the Y axial direction while changing the number ofcomputing nodes continuous therefrom in the X axial direction.Furthermore, the parallel computer system searches for the number ofidle nodes continuous from the selected computing node in the X axialdirection while changing the number of computing nodes continuoustherefrom in the Y axial direction. The parallel computer systemexecutes these pieces of processing for all the computing nodes so as toacquire pieces of search data indicating all the regions as the jobassignment targets.

FIG. 28 is a view for explaining an example of the processing ofsearching the idle nodes. FIG. 28 illustrates pieces of search data thatare acquired by the parallel computer system while they are grouped forrespective computing nodes as origins of regions as job assignmenttargets when all the nodes included in the parallel computer system arethe idle nodes. Among the pieces of search data as illustrated in FIG.28, pieces of search data indicating regions that are the same asregions indicated by another search data are hatched as pieces ofinvalid data.

In the example illustrated in FIG. 28, when coordinates at which thecomputing node as the origin is arranged are expressed as (a, b), “e” asthe number of idle nodes continuous in the Y axial direction that hasbeen searched for “d” as the number of computing nodes in the X axialdirection is expressed as T[a][b], xy[c]=(d, e). Furthermore, in theexample illustrated in FIG. 28, “d” as the number of idle nodescontinuous in the X axial direction that has been searched for “e” asthe number of computing nodes in the Y axial direction is expressed asT[a][b], yx[c]=(d, e). It is noted that “c” is an array subscript foridentifying search data.

For example, in the example illustrated in FIG. 28, the parallelcomputer system acquires (4, 3), (3, 3), (2, 3), (1, 3), (4, 3), (4, 2),and (4, 1) as pieces of search data indicating regions in which thecomputing node arranged at coordinates (0, 0) is set to the origin. Thatis to say, the parallel computer system acquires the pieces of searchdata indicating four regions having three computing nodes in the Y axialdirection and one to four computing node(s) in the X axial direction andthree regions having four computing nodes in the X axial direction andone to three computing node(s) in the Y axial direction.

In addition, the parallel computer system acquires pieces of search dataindicating regions in which respective computing nodes are set to theorigins for other computing nodes. Thereafter, the parallel computersystem sorts the pieces of acquired search data in the descending orderof the number of computing nodes included in the region. Thereafter, theparallel computer system selects search data indicating a minimum regionsatisfying the number of computing nodes as the job assignment targetsfrom the pieces of sorted search data and assigns the job to thecomputing nodes included in the selected region.

Examples of the related techniques are described in Japanese Laid-openPatent Publication No. 2012-252591 and International PublicationPamphlet No. WO 2008/114440.

With the above-mentioned techniques of searching the regions as the jobassignment targets, all the regions including the continuous idle nodesare searched. This causes a problem that the search cost is increased inaccordance with the number of computing nodes.

Hereinafter, an example of processing of searching all the regions asthe job assignment targets that is performed by the parallel computersystem is described with reference to FIGS. 29 to 31. In the followingexample, the related parallel computer system searches rectangularregions including the continuous idle nodes.

First, the procedure of processing of selecting an informationprocessing device that is set to an origin of a region is described withreference to FIG. 29. FIG. 29 is a first flowchart for explaining theprocedure of related idle node search processing. In the exampleillustrated in FIG. 29, the parallel computer system initializes a Yvalue to “0” (step S1), and determines whether the Y value is smallerthan 3 (step S2). If the Y value is smaller than 3 (Yes at step S2), theparallel computer system initializes an X value to “0” (step S3) anddetermines whether the X value is smaller than 4 (step S4).

If the X value is smaller than 4 (Yes at step S4), the parallel computersystem executes Y-axis fixed search processing of searching the numberof idle nodes continuous in the X axial direction while fixing the Yvalue (step S5). Thereafter, the parallel computer system executesX-axis fixed search processing of searching the number of idle nodescontinuous in the Y axial direction while fixing the X value (step S6).

Subsequently, the parallel computer system adds 1 to the X value (stepS7) and executes step S4. On the other hand, if the X value is equal toor larger than 4 (No at step S4), the parallel computer system adds 1 tothe Y value (step S8) and executes step S2. Thereafter, if the Y valueis equal to or larger than 3 (No at step S2), the parallel computersystem finishes the processing.

Next, an example of the Y-axis fixed search processing is described withreference to FIG. 30. FIG. 30 is a second flowchart for explaining theprocedure of the related idle node search processing. FIG. 30illustrates the flowchart for explaining the procedure of the Y-axisfixed search processing at step S5 in FIG. 29.

For example, the parallel computer system initializes values ofvariables XMax, i, c, d, and e to set XMax=4−X, i=X, c=Y, d=0, and e=1(step S10). The parallel computer system then determines whether the cvalue is smaller than 3 (step S11). If the c value is smaller than 3(Yes at step S11), the parallel computer system determines whether the ivalue is smaller than 4 (step S12).

If the i value is smaller than 4 (Yes at step S12), the parallelcomputer system determines whether the i value is smaller than the XMaxvalue (step S13). If the i value is smaller than the XMax value (Yes atstep S13), the parallel computer system determines whether a computingnode T[i][c] arranged at coordinates (i, c) is an idle node (step S14).If the computing node T[i][c] is the idle node (Yes at step S14), theparallel computer system adds 1 to each of the d and i values (step S15)and executes step S12.

On the other hand, if the i value is equal to or larger than 4 (No atstep S12), if the i value is equal to or larger than XMax (No at stepS13), or if T[i][c] is not the idle node (No at step S14), the parallelcomputer system executes the following processing. That is, the parallelcomputer system outputs (d, e) as search data T[X][Y]yx[c] and setsXMax=d, and then, initializes the i and d values to set i=X and d=0, andadds 1 to each of the c and e values (step S16). Subsequently, theparallel computer system executes step S11. If the c value is equal toor larger than 3 (No at step S11), the parallel computer system finishesthe Y-axis fixed search processing.

Next, an example of the X-axis fixed search processing is described withreference to FIG. 31. FIG. 31 is a third flowchart for explaining theprocedure of the related idle node search processing. FIG. 31illustrates the flowchart for explaining the procedure of the X-axisfixed search processing at step S6 in FIG. 29.

For example, the parallel computer system initializes values of thevariables YMax, i, c, d, and e to set YMax=3−Y, i=Y, c=X, d=1, and e=0(step S20). The parallel computer system then determines whether the cvalue is smaller than 4 (step S21). If the c value is smaller than 4(Yes at step S21), the parallel computer system determines whether the ivalue is smaller than 3 (step S22).

If the i value is smaller than 3 (Yes at step S22), the parallelcomputer system determines whether the i value is smaller than YMax(step S23). If the i value is smaller than YMax (Yes at step S23), theparallel computer system determines whether a computing node T[c][i]arranged at coordinates (c, i) is the idle node (step S24). If thecomputing node T[c][i] is the idle node (Yes at step S24), the parallelcomputer system adds 1 to each of the e and i values (step S25) andexecutes step S22.

On the other hand, if the i value is equal to or larger than 3 (No atstep S22), if the i value is equal to or larger than YMax (No at stepS23), or if T[c][i] is not the idle node (No at step S24), the parallelcomputer system executes the following processing. That is, the parallelcomputer system outputs (d, e) as search data T[X][Y]xy[c] and setsYMax=e, and then, initializes the i and e values to set i=Y, e=0, andadds 1 to each of the c and d values (step S26). Subsequently, theparallel computer system executes step S21. If the c value is equal toor larger than 4 (No at step S21), the parallel computer system finishesthe X-axis fixed search processing.

When the parallel computer system searches the regions as the jobassignment targets in the above-mentioned manner, the parallel computersystem executes condition determination processing included in theY-axis fixed search processing and the X-axis fixed search processingrepeatedly. For this reason, the number of times of the conditiondetermination processing that the parallel computer system executes isincreased as the number of computing nodes is increased. Due to this,the parallel computer system is incapable of completing the processwithin practical time in some cases.

SUMMARY

According to an aspect of the embodiments, a parallel computer systemincludes: a parallel computing device including a plurality ofinformation processing devices connected to one another; and amanagement device managing the parallel computing device. The managementdevice includes: a memory; and a processor coupled to the memory. Theprocessor executes a process including: storing therein an assignmenttable including first assignment information indicating whether a job isassigned to the information processing devices and second assignmentinformation indicating that a job is constantly assigned to virtualinformation processing devices arranged at ends of a connection relationof the information processing devices; searching regions in which idleinformation processing devices assigned with no job are arrangedcontinuously, using the assignment table stored at the storing;specifying a region appropriate for assignment of a job as an assignmenttarget among the regions searched by the searching; and assigning thejob as the assignment target to the region specified by the specifying.

The object and advantages of the invention will be realized and attainedby means of the elements and combinations particularly pointed out inthe claims.

It is to be understood that both the foregoing general description andthe following detailed description are exemplary and explanatory and arenot restrictive of the invention.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 is a diagram for explaining a parallel computer system accordingto a first embodiment;

FIG. 2 is a view for explaining an example of a node table that isgenerated by a management device in the first embodiment;

FIG. 3 is a view for explaining Y-axis fixed search processing that isexecuted by the management device in the first embodiment;

FIG. 4 is a view for explaining X-axis fixed search processing that isexecuted by the management device in the first embodiment;

FIG. 5 is a view for explaining an example of processing of specifyingidle regions that is performed by the management device in the firstembodiment;

FIG. 6 is a view for explaining processing of selecting search data froma list such that a space in which idle nodes are continuous is thelargest.

FIG. 7 is a flowchart for explaining the procedure of the Y-axis fixedsearch processing that is executed by the management device in the firstembodiment;

FIG. 8 is a flowchart for explaining the procedure of the X-axis fixedsearch processing that is executed by the management device in the firstembodiment;

FIG. 9 is a diagram for explaining a parallel computer system accordingto a second embodiment;

FIG. 10 is a view for explaining the procedure of processing that isexecuted for the X axial direction by a management device in the secondembodiment;

FIG. 11 is a view for explaining the procedure of processing that isexecuted for the Y axial direction by the management device in thesecond embodiment;

FIG. 12 is a graph for explaining an example of the number of times ofcondition determination that is executed by a related parallel computersystem;

FIG. 13 is a graph for explaining an example of the number of times ofcondition determination that is executed by the management device in thesecond embodiment;

FIG. 14 is a flowchart for explaining the procedure of main processingthat is executed by the management device in the second embodiment;

FIG. 15 is a flowchart for explaining the procedure of Y-axis fixedsearch processing that is executed by the management device in thesecond embodiment;

FIG. 16 is a flowchart for explaining the procedure of X-axis fixedsearch processing that is executed by the management device in thesecond embodiment;

FIG. 17 is a diagram for explaining a parallel computer system accordingto a third embodiment;

FIG. 18 is a view for explaining examples of a virtual origin;

FIG. 19 is a view for explaining processing that is executed by amanagement device in the third embodiment;

FIG. 20 is a view for explaining the procedure of processing of deletingpieces of search data that is executed by the management device in thethird embodiment;

FIG. 21 is a graph for explaining an example of the number of pieces ofsearch data that are output from a related parallel computer system;

FIG. 22 is a graph for explaining an example of the number of pieces ofsearch data that are output from the management device in the thirdembodiment;

FIG. 23 is a graph for explaining an example of the number of times ofcondition determination that is executed by the related parallelcomputer system in consideration of torus in the X axial direction;

FIG. 24 is a graph for explaining an example of the number of times ofcondition determination that is executed by the management device in thethird embodiment;

FIG. 25 is a flowchart for explaining the procedure of main processingthat is executed by the management device in the third embodiment;

FIG. 26 is a flowchart for explaining the procedure of four-parallelprocessing that is executed by the management device in the thirdembodiment;

FIG. 27 is a diagram for explaining an example of a computer thatexecutes a control program;

FIG. 28 is a view for explaining an example of processing of searchingidle nodes;

FIG. 29 is a first flowchart for explaining the procedure of relatedidle node search processing;

FIG. 30 is a second flowchart for explaining the procedure of therelated idle node search processing; and

FIG. 31 is a third flowchart for explaining the procedure of the relatedidle node search processing.

DESCRIPTION OF EMBODIMENTS

Preferred embodiments will be explained with reference to accompanyingdrawings. The disclosed technique is not limited by the followingembodiments. Furthermore, the embodiments may be combined appropriatelywithin a range where the combined embodiment is consistent with theembodiments.

[a] First Embodiment

In the following first embodiment, an example of a parallel computersystem according to the present application is described with referenceto FIG. 1. FIG. 1 is a diagram for explaining the parallel computersystem in the first embodiment. In the example illustrated in FIG. 1, aparallel computer system 1 includes an input device 2, a parallelcomputer 3, an output device 4, and a management device 10.

The input device 2 is an input device for inputting a job that isexecuted by the parallel computer system 1. For example, the inputdevice 2 outputs contents of the job that is input by a user of theparallel computer system 1 to the management device 10. Furthermore,when the input device 2 receives input of the number or topology ofcomputing nodes as job assignment targets, the input device 2 notifiesthe management device 10 of the number or the topology of computingnodes that has been received. For example, the input device 2 receivesinformation “(2, 3)” indicating six computing nodes in total of three inthe Y axial direction and two in the X axial direction that have beenconnected in a mesh form as the topology of the computing nodes as thejob assignment targets. In this case, the input device 2 notifies themanagement device 10 of the received information “(2, 3)” together withthe job to be assigned.

The parallel computer 3 includes a plurality of computing nodes 3 a to 3f. The parallel computer 3 includes a plurality of computing nodes inaddition to the computing nodes 3 a to 3 f illustrated in FIG. 1. In thefollowing description, the computing nodes 3 b to 3 f exhibit the samefunctions as those of the computing node 3 a and description thereof isomitted.

The computing node 3 a is an information processing device that executesvarious pieces of information processing. A central processing unit(CPU), a micro processing unit (MPU), a graphic processing unit (GPU),an application specific integrated circuit (ASIC), or the like isemployed as the computing node 3 a as an example. The computing node 3 amay be an information processing device including a plurality of CPUs orthe like, a memory, and an input/output (I/O).

The respective computing nodes 3 a to 3 f are connected in atwo-dimensional mesh form and make communication between the connectedcomputing nodes. For example, the computing nodes 3 a to 3 f form atwo-dimensional mesh network in which four computing nodes are arrangedin each X axial direction and three computing nodes are arranged in eachY axial direction and adjacent computing nodes are connected. Forexample, when the computing node 3 a makes data communication with thecomputing node 3 c that is not connected directly to the computing node3 a, it makes data communication with the computing node 3 c through thecomputing node 3 b or other computing nodes.

In the following description, among the computing nodes that areconnected in the two-dimensional mesh form, the computing node arrangedat an end point is set to an origin and the coordinates at which therespective computing nodes 3 a to 3 f are arranged are expressed usingthe number of computing nodes from the origin in the respective axialdirections. That is to say, the parallel computer system 1 sets aconnection distance to the coordinates at which each computing node isarranged. The connection distance indicates the number of computingnodes that are connected in the respective axial directions from thecomputing node as the origin. For example, the computing node that isdistanced from the computing node as the origin by d computing nodes inthe X axial direction and e computing nodes in the Y axial directioncorresponds to the computing node arranged at coordinates (d, e).Furthermore, in the following description, it is assumed that theparallel computer 3 has a network in which twelve computing nodes intotal of three in the X axial direction and four in the Y axialdirection are connected in the two-dimensional mesh form.

On the other hand, the management device 10 includes a storage unit 11,a generator 13, a receiver 14, a search unit 15, a specifying unit 16,and an assignment unit 17. The storage unit 11 stores therein a nodetable 12.

The node table 12 is a table storing therein information indicatingwhether a job is assigned to the respective computing nodes 3 a to 3 f.The following describes an example of the node table 12 with referenceto FIG. 2. FIG. 2 is a view for explaining an example of the node tablethat is generated by the management device in the first embodiment.

For example, as illustrated in FIG. 2, the node table 12 stores thereincoordinates of the respective computing nodes and valid bits indicatingwhether a job is assigned to the respective computing nodes. Forexample, the node table 12 stores therein “(0, 0)=0” indicating that nojob is assigned to the computing node at the origin. Furthermore, thenode table 12 stores therein “(0, 1)=0”, “(0, 2)=0”, “(1, 0)=0”, “(1,1)=0”, and “(1, 2)=0” indicating the coordinates and the valid bits ofthe respective computing nodes. In addition, the node table 12 storestherein “(2, 0)=0”, “(2, 1)=0”, “(2, 2)=0”, “(3, 0)=0”, “(3, 1)=0”, and“(3, 2)=0”.

As indicated by dotted lines in FIG. 2, the node table 12 stores thereincoordinates of virtual computing nodes arranged at termination ends ofthe network formed by the computing nodes 3 a to 3 f and valid bitsindicating that a job is constantly assigned to the virtual computingnodes. To be specific, the node table 12 stores therein “(0, 3)=1”, “(1,3)=1”, “(2, 3)=1”, “(3, 3)=1”, “(4, 0)=1”, “(4, 1)=1”, “(4, 2)=1”, and“(4, 3)=1”. In the following description, computing nodes that arevirtual, are arranged at the termination ends of the network, and areconstantly assigned with the job are referred to as virtual computingnodes.

Description is continued with reference to FIG. 1, again. The generator13 generates the node table 12. To be specific, the generator 13generates information in which the coordinates of the computing nodes 3a to 3 f and the valid bits indicating whether a job is assigned to thecomputing nodes are made to correspond to each other. The generator 13further generates the coordinates of the virtual computing nodesarranged at the termination ends of the network formed by the computingnodes 3 a to 3 f, and generates information in which the valid bitsindicating that the job is assigned are made to correspond to thegenerated coordinates. Furthermore, the generator 13 stores the piecesof generated information as the node table 12 in the storage unit 11.

The receiver 14 receives the job to be assigned and the number or thetopology of computing nodes as the job assignment targets from the inputdevice 2. In this case, the receiver 14 requests the search unit 15 tosearch regions in which idle nodes as computing nodes assigned with nojob are continuous and notifies the specifying unit 16 of the number orthe topology of computing nodes that has been received. In addition, thereceiver 14 outputs the received job to the assignment unit 17.

The search unit 15 searches all the regions in which the idle nodes arearranged continuously, using the node table 12 generated by thegenerator 13. To be specific, the search unit 15 selects the computingnode included in the parallel computer 3 sequentially and executesX-axis fixed search processing of counting the number of idle nodescontinuous from the selected computing node as a base point in the Yaxial direction while changing the connection distance therefrom in theX axial direction. Furthermore, the search unit 15 executes Y-axis fixedsearch processing of counting the number of idle nodes continuous fromthe selected computing node as the base point in the X axial directionwhile changing the connection distance therefrom in the Y axialdirection.

As a result of the X-axis fixed search processing and the Y-axis fixedsearch processing, the search unit 15 outputs, as search data, the sizeof a region in which the idle nodes are continuous in the X axialdirection and the Y axial direction while setting the selected computingnode as the base point. The following describes the Y-axis fixed searchprocessing and the X-axis fixed search processing that are executed bythe search unit 15. In the following description, the search unit 15searches rectangular regions for making assignment of the job easily.

First, the Y-axis fixed search processing that is executed by the searchunit 15 is described with reference to FIG. 3. FIG. 3 is a view forexplaining the Y-axis fixed search processing that is executed by themanagement device in the first embodiment. FIG. 3 illustrates contentsof the Y-axis fixed search processing that is executed by the searchunit 15 when the computing node arranged at coordinates (0, 0) is set tothe base point. In the example illustrated in FIG. 3, it is assumed thata job is assigned to the computing node arranged at coordinates (3, 1).

First, as indicated by (A) in FIG. 3, the search unit 15 initializesXMax as a maximum value of the number of computing nodes in the X axialdirection that are included in a region to be searched. For example, thesearch unit 15 sets XMax to “4” as the number of computing nodes to thevirtual computing nodes at the termination end in the X axial direction.Thereafter, as indicated by (B) in FIG. 3, the search unit 15 determineswhether the job is assigned to the computing nodes from the computingnode arranged at the coordinates (0, 0) to the computing node of whichthe connection distance in the X axial direction is the same as Xmax,that is, the computing node arranged at coordinates (4, 0) sequentially.

Meanwhile, in the related parallel computer system, every time it isdetermined whether the computing node as a determination target is theidle node, it is determined whether processing of determining whetherthe computing node is the idle node has been executed for all thecomputing nodes continuous in the X axial direction. When the processingis executed, the number of times of the determination processing isincreased as the number of computing nodes included in the parallelcomputer 3 is increased.

On the other hand, in the parallel computer system 1, the node table 12includes pieces of data of the virtual computing nodes constantlyassigned with the job. With this configuration, the search unit 15 cansearch the region in which the idle nodes are continuous appropriatelysimply by determining whether the respective computing nodes are theidle nodes without determining whether the processing of determiningwhether the computing node is the idle node has been executed for allthe computing nodes continuous in the X axial direction.

For example, in the example illustrated in FIG. 3, the search unit 15determines whether the computing node is the idle node for the computingnodes from the computing node at the coordinates (0, 0) to the computingnode at the coordinates (3, 0) sequentially. After the search unit 15determines whether the computing node at the coordinates (3, 0) is theidle node, it determines whether the job is assigned to the computingnode at the coordinates (4, 0), that is, the virtual computing node, asindicated by (C) in FIG. 3. As a result of this, the search unit 15determines that the job is assigned to the computing node at thecoordinates (4, 0). The search unit 15 also determines that “4”computing nodes from the computing node at the coordinates (0, 0) to thecomputing node at the coordinates (3, 0) are the idle nodes.

Consequently, the search unit 15 determines that the searchingprocessing in the X axial direction when the connection distance in theY axial direction is set to “1” has been completed. Thereafter, thesearch unit 15 outputs T[0][0], yx[0]=(4, 1) as search data of a firstregion in the Y-axis fixed search when the coordinates (0, 0) are set tothe base point. T[0][0], yx[0]=(4, 1) indicates the region in which thenumber of idle nodes in the X axial direction is “4” and the number ofidle nodes in the Y axial direction is “1”. In this manner, the searchunit 15 can determine whether the search processing in the X axialdirection has been completed without determining whether thedetermination processing to the computing node at the termination end inthe X axial direction has been executed.

Thereafter, as indicated by (D) in FIG. 3, the search unit 15 updatesthe XMax value to “4” as the number of continuous idle nodes.Subsequently, as indicated by (E) in FIG. 3, the search unit 15 selectsthe computing node that is connected to the computing node at the basepoint in the Y axial direction, that is, the computing node arranged atcoordinates (0, 1). The search unit 15 also determines whether the jobis assigned to the computing nodes from the computing node arranged atthe coordinates (0, 1) to the computer node distanced therefrom by thenumber of computing nodes that is the same as XMax, in other words, thecomputing node arranged at coordinates (3, 1) sequentially.

In this case, as indicated by (F) in FIG. 3, the job is assigned to thecomputing node arranged at the coordinates (3, 1). Based on this, thesearch unit 15 determines that the number of continuous idle nodes is“3” when the coordinates (0, 0) are set to the base point and the sizein the Y axial direction is set to “2”. As a result, the search unit 15outputs T[0][0], yx[1]=(3, 2) as search data of a second region when thecoordinates (0, 0) are set to the base point.

Thereafter, as indicated by (G) in FIG. 3, the search unit 15 updatesthe XMax value to “3” as the number of continuous idle nodes. The searchunit 15 also selects the computing node that is connected to thecomputing node selected previously in the Y axial direction, that is,the computing node arranged at coordinates (0, 2). The search unit 15also determines whether the job is assigned to the computing nodes fromthe computing node arranged at the coordinates (0, 2) to the computernode distanced therefrom in the X axial direction by the number ofcomputing nodes that is the same as XMax, in other words, the computingnode arranged at coordinates (2, 2) sequentially.

In the example illustrated in FIG. 3, no job is assigned to thecomputing node arranged at the coordinates (0, 2) to the computing nodearranged at the coordinates (2, 2). In this case, the search unit 15determines that the number of continuous idle nodes is “3” when thecoordinates (0, 0) are set to the base point and the size in the Y axialdirection is set to “3”. As a result, the search unit 15 outputsT[0][0], yx[2]=(3, 3) as search data of a third region when thecoordinates (0, 0) are set to the base point.

As illustrated in FIG. 3, when the job is assigned to the computing nodearranged at the coordinates (3, 1), a region of which the connectiondistance from the computing node at the base point is (3, 3) is amaximum rectangular region in which the computing nodes assigned with nojob are continuous. When the job is assigned to the computing node atthe coordinates (3, 1), processing of determining whether the job isassigned to the computing node at the coordinates (3, 2) is uselessprocessing.

For this reason, the search unit 15 stores, as XMax, the minimum valueamong the numbers of idle nodes continuous in the respective X axialdirections in the Y-axis fixed search processing. The search unit 15also determines whether the job is assigned to only the computing nodeof which the connection distance is the same as the stored XMax when thesize in the Y axial direction is changed. For example, as indicated by(H) in FIG. 3, the search unit 15 does not execute the processing ofdetermining whether the job is assigned to the computing node arrangedat coordinates (3, 2). This enables the search unit 15 to eliminateuseless determination in the Y-axis fixed search processing when thesearch unit 15 searches the rectangular region.

Next, the X-axis fixed search processing that is executed by the searchunit 15 is described with reference to FIG. 4. FIG. 4 is a view forexplaining the X-axis fixed search processing that is executed by themanagement device in the first embodiment. FIG. 4 illustrates contentsof the X-axis fixed search processing that is executed by the searchunit 15 when the computing node arranged at the coordinates (0, 0) isset to the base point. In the example illustrated in FIG. 4, it isassumed that a job is assigned to the computing node arranged atcoordinates (1, 2).

First, the search unit 15 initializes YMax as a maximum value of thenumber of computing nodes in the Y axial direction that are included ina region to be searched. For example, the search unit 15 sets YMax to“3” as the number of computing nodes to the virtual computing nodes atthe termination end in the Y axial direction. Thereafter, as indicatedby (I) in FIG. 4, the search unit 15 determines whether the job isassigned to the computing nodes from the computing node arranged at thecoordinates (0, 0) to the computing node of which the connectiondistance in the Y axial direction is the same as Ymax, that is, thecomputing node arranged at coordinates (0, 3) sequentially.

In the example illustrated in FIG. 4, the search unit 15 determineswhether the computing node is the idle node for the computing nodes fromthe computing node at the coordinates (0, 0) to the computing node atcoordinates (0, 2) sequentially. After the search unit 15 determineswhether the computing node at the coordinates (0, 2) is the idle node,it determines whether the job is assigned to the computing node at thecoordinates (0, 3), that is, the virtual computing node, as indicated by(J) in FIG. 4.

As a result of this, the search unit 15 determines that the job isassigned to the computing node at the coordinates (0, 3). The searchunit 15 also determines that “3” computing nodes from the computing nodearranged at the coordinates (0, 0) to the computing node arranged at thecoordinates (0, 2) are the idle nodes. As a result, the search unit 15outputs T[0][0], xy[0]=(1, 3) as search data of a first region in theX-axis fixed search when the coordinates (0, 0) are set to the basepoint. T[0][0], xy[0]=(1, 3) indicates the region of which theconnection distance in the Y axial direction is “3” and the connectiondistance in the X axial direction is “1”.

Thereafter, the search unit 15 updates the YMax value to “3” as thenumber of continuous idle nodes. The search unit 15 also selects thecomputing node that is connected to the computing node at the base pointin the X axial direction, that is, the computing node arranged atcoordinates (1, 0). The search unit 15 also determines whether the jobis assigned to the computing nodes from the computing node arranged atthe coordinates (1, 0) to the computer node distanced therefrom by thenumber of computing nodes that is the same as Ymax, in other words, thecomputing node arranged at coordinates (1, 2) sequentially.

In this case, as indicated by (K) in FIG. 4, the job is assigned to thecomputing node arranged at the coordinates (1, 2). Based on this, thesearch unit 15 determines that the number of continuous idle nodes is“2” when the coordinates (0, 0) are set to the base point and the sizein the X axial direction is set to “2”. As a result, the search unit 15outputs T[0][0], xy[1]=(2, 2) as search data of a second region when thecoordinates (0, 0) are set to the base point.

Thereafter, as indicated by (L) in FIG. 4, the search unit 15 updatesthe YMax value to “2” as the number of continuous idle nodes. The searchunit 15 also selects the computing node that is connected to thecomputing node selected previously in the X axial direction, that is,the computing node arranged at coordinates (2, 0). Thereafter, asindicated by (M) in FIG. 4, the search unit 15 determines whether thejob is assigned to the computing nodes from the computing node arrangedat the coordinates (2, 0) to the computer node connected thereto in theY axial direction and distanced therefrom by the number of computingnodes that is the same as Ymax, in other words, the computing nodearranged at coordinates (2, 1) sequentially.

In the example illustrated in FIG. 4, no job is assigned to thecomputing node arranged at the coordinates (2, 0) to the computing nodearranged at the coordinates (2, 1). In this case, the search unit 15determines that the number of continuous idle nodes is “2” when thecoordinates (0, 0) are set to the base point and the size in the X axialdirection is “3”. As a result, the search unit 15 outputs T[0][0],xy[2]=(3, 2) as search data of a third region when the coordinates (0,0) are set to the base point.

Thereafter, the search unit 15 updates the YMax value to “2” as thenumber of continuous idle nodes. The search unit 15 also selects thecomputing node that is connected to the computing node selectedpreviously in the X axial direction, that is, the computing nodearranged at coordinates (3, 0). Thereafter, as indicated by (M) in FIG.4, the search unit 15 determines whether the job is assigned to thecomputing nodes from the computing node arranged at the coordinates (3,0) to the computer node connected thereto in the Y axial direction anddistanced therefrom by the number of computing nodes that is the same asYmax, in other words, the computing node arranged at the coordinates(3, 1) sequentially.

Based on this, the search unit 15 determines that the number ofcontinuous idle nodes is “2” when the coordinates (0, 0) are set to thebase point and the magnitude in the X axial direction is “4”. As aresult, the search unit 15 outputs T[0][0], xy[2]=(4, 2) as search dataof a fourth region when the coordinates (0, 0) are set to the basepoint.

In this manner, the search unit 15 searches for the regions in which theidle nodes are continuous using the node table 12 indicating that thevirtual computing nodes constantly assigned with the job are arranged atthe termination ends of the network formed by the computing nodes 3 a to3 f. This enables the search unit 15 to eliminate the processing ofdetermining whether determination whether the computing node is the idlenode has been executed for the computing nodes from the computing nodeat the base point to the computing nodes at the termination ends in therespective axial directions. As a result, the search unit 15 can reducethe number of times of determination of the processing of searching theregions in which the idle nodes are continuous.

The search unit 15 counts the number of idle nodes continuous from thecomputing node at the base point in the predetermined axial direction.When the search unit 15 changes the number of computing nodes continuousin the direction other than the predetermined axial direction and countsthe number of idle nodes continuous in the predetermined axialdirection, the search unit 15 determines whether the computing node isthe idle node for the computing nodes by the number of computing nodesthat is the same as the number of idle nodes continuous in thepredetermined axial direction counted before. This enables the searchunit 15 to further reduce the number of times of determination of theprocessing of searching the regions in which the idle nodes arecontinuous.

Description is continued with reference to FIG. 1, again. The specifyingunit 16 specifies a region appropriate for the job assignment among theregions searched by the search unit. For example, the specifying unit 16receives the number or the topology of computing nodes included in theregion as the job assignment target from the receiver 14. Furthermore,the specifying unit 16 receives pieces of search data indicating all theregions searched by the search unit 15.

In this case, the specifying unit 16 sorts the received pieces of searchdata by the number of computing nodes included in each region.Thereafter, the specifying unit 16 determines whether the search datasatisfies the number or the topology of computing nodes received fromthe receiver 14 in the order from the search data of which the number ofcomputing nodes included in the region is smaller among the pieces ofsorted search data. Thereafter, when the specifying unit 16 determinesthat the search data satisfies the number or the topology of computingnodes received from the receiver 14, the specifying unit 16 outputs thesearch data to the assignment unit 17.

For example, FIG. 5 is a view for explaining an example of processing ofspecifying an idle region that is performed by the management device inthe first embodiment. In FIG. 5, the pieces of search data acquired fromthe search unit 15 when all the computing nodes 3 a to 3 f included inthe parallel computer 3 are the idle nodes are illustrated while beinggrouped for the respective computing nodes at the base points. Among thepieces of search data as illustrated in FIG. 5, pieces of search dataindicating regions that are the same as regions indicated by anothersearch data are hatched as pieces of invalid data.

For example, the specifying unit 16 acquires pieces of search data asindicated by (N) in FIG. 5. In this case, as indicated by (O) in FIG. 5,the specifying unit 16 sorts the pieces of search data by the number ofcomputing nodes included in each region. Thereafter, the specifying unit16 determines whether the search data is search data indicating a regionidentical to the number or the topology of nodes received from thereceiver 14 in the order from the lowest-order data among the pieces ofsorted search data. For example, when the specifying unit 16 receivestopology (3, 2) from the receiver 14, the specifying unit 16 searchessearch data indicating that the size of the region is (3, 2) in theorder from the lowest-order data. Thereafter, the specifying unit 16outputs the specified search data to the assignment unit 17.

The processing that is executed by the specifying unit 16 is not limitedto the above-mentioned processing. For example, when there are aplurality of pieces of search data indicating regions identical to thenumber or the topology of nodes received from the receiver 14, thespecifying unit 16 may select search data indicating a region as the jobassignment target such that a space in which the idle nodes arecontinuous after the job assignment becomes the largest.

For example, FIG. 6 is a view for explaining processing of selecting thesearch data from a list such that the space in which the idle nodes arecontinuous becomes the largest. FIG. 6 illustrates an example in which aplurality of three-node jobs each using three nodes are assigned to anetwork formed by six computing nodes arranged in the X axial directionand five computing nodes arranged in the Y axial direction.

As indicated by (P-1) in FIG. 6, when four three-node jobs are arrangedrandomly, the management device 10 limits the largest idle space as thelargest region in which the idle nodes are continuous to be a spaceformed by eight nodes, for example. On the other hand, as indicated by(P-2) in FIG. 6, when four three-node jobs are assigned to the nodesfrom the ends of the network continuously, the management device 10 canexpand the largest idle space to a space formed by eighteen nodes.

In view of this, when there are the plurality of pieces of search dataindicating regions identical to the number or the topology of nodesreceived from the receiver 14, the specifying unit 16 executes thefollowing processing. In the following description, the search dataindicating the region identical to the number or the topology of nodesreceived from the receiver 14 is referred to as identical data. First,when there are the plurality of pieces of identical data, the specifyingunit 16 specifies, for each identical data, search data indicating aregion that is higher-order than the identical data and becomesincapable of being used when the job is assigned to the identical dataamong the pieces of sorted search data.

The specifying unit 16 specifies identical data for which the size ofthe region indicated by the specified search data is the smallest andnotifies the assignment unit 17 of the specified identical data. Theabove-mentioned processing enables the specifying unit 16 to eliminatefragmentation of the region as the job assignment target so as to assignthe job efficiently.

Description is continued with reference to FIG. 1, again. The assignmentunit 17 assigns the job to the region specified by the specifying unit16. For example, the assignment unit 17 receives the job from thereceiver 14. Furthermore, the assignment unit 17 receives the searchdata indicating the region as the job assignment target from thespecifying unit 16. In this case, the assignment unit 17 assigns the jobreceived from the receiver 14 to the computing nodes included in theregion indicated by the search data. The assignment unit 17 updates thevalid bits of the computing nodes assigned with the job to “1” among thevalid bits of the respective computing nodes that are stored in the nodetable 12.

When execution of the job is completed, the assignment unit 17 receivesjob execution results from the computing nodes that have completelyexecuted the job and outputs the received job execution results to theoutput device 4. The assignment unit 17 updates the valid bits relatedto the computing nodes that have completely executed the job to “0”among the valid bits of the respective computing nodes that are storedin the node table 12.

When the computing nodes 3 a to 3 f form a two-dimensional torusnetwork, a region as the job assignment target can be specified byexecuting the following processing. For example, when the computingnodes 3 a to 3 f form the two-dimensional torus network coming around inthe X axial direction, the generator 13 selects computing nodes of whichthe coordinates in the Y axial direction are “0” sequentially.Thereafter, the generator 13 generates the node table 12 indicating thatthe computing nodes 3 a to 3 f form the two-dimensional mesh network inwhich the selected computing node is set to a virtual origin for each ofthe selected computing nodes. In other words, the generator 13 generatesthe node table 12 in which each computing node having the coordinate of“0” in the Y axial direction is set to the virtual origin.

The search unit 15 selects the computing nodes of which the coordinatesin the Y axial direction are “0” as the virtual origins sequentially,and executes the above-mentioned search processing using the node table12 corresponding to each of the selected virtual origins. As a result ofthis, the search unit 15 generates the pieces of search data asindicated by (N) in FIG. 5 for the number of virtual origins.Thereafter, the specifying unit 16 specifies a region that is optimumfor the job assignment using all pieces of search data generated by thesearch unit 15.

For example, when the computing nodes 3 a to 3 f form thetwo-dimensional torus network coming around in the X axial direction,the specifying unit 16 takes the largest idle space node coming aroundin the X axial direction as indicated by (P-3) in FIG. 6 intoconsideration. Based on this, the specifying unit 16 may arrange fourthree-node jobs so as to be aligned in the Y axial direction.

Next, the procedure of the processing that is executed by the managementdevice 10 is described. The management device 10 executes the mainprocessing of selecting the computing node at the base point of aregion, the X-axis fixed search processing, and the Y-axis fixed searchprocessing. The main processing that is executed by the managementdevice 10 is the same as the processing that is executed by the relatedparallel computer system as illustrated in FIG. 29, and descriptionthereof is omitted.

First, the procedure of the Y-axis fixed search processing that isexecuted by a management device 10 is described with reference to FIG.7. FIG. 7 is a flowchart for explaining the procedure of the Y-axisfixed search processing that is executed by the management device in thefirst embodiment. For example, the management device 10 initializesvalues of the variables XMax, i, c, d, and e to set XMax=4−X, i=X, c=Y,d=0, and e=1 (step S101). The management device 10 then determineswhether the c value is smaller than 3 (step S102). If the c value issmaller than 3 (Yes at step S102), the parallel computer systemdetermines whether the i value is smaller than XMax (step S103).

When the i value is smaller than XMax (Yes at step S103), the parallelcomputer system determines whether a computing node T[i][c] arranged atcoordinates (i, c) is the idle node (step S104). If the computing nodeT[i][c] is the idle node (Yes at step S104), the parallel computersystem adds 1 to each of the d and i values (step S105) and executesstep S103.

On the other hand, if the i value is equal to or larger than XMax (No atstep S103) or when T[i][c] is not the idle node (No at step S104), theparallel computer system executes the following processing. That is, theparallel computer system outputs (d, e) as search data T[X][Y]yx[c] andsets XMax=d. Thereafter, the parallel computer system initializes the iand d values to set i=X and d=0, and adds 1 to each of the c and evalues (step S106). Thereafter, the parallel computer system executesstep S102. If the c value is equal to or larger than 3 (No at stepS102), the parallel computer system finishes the Y-axis fixed searchprocessing.

Next, an example of the X-axis fixed search processing is described withreference to FIG. 8. FIG. 8 is a flowchart for explaining the procedureof the X-axis fixed search processing that is executed by the managementdevice in the first embodiment. For example, the parallel computersystem initializes values of the variables YMax, i, c, d, and e to setYMax=3−Y, i=Y, c=X, d=1, and e=0 (step S201). The parallel computersystem then determines whether the c value is smaller than 4 (stepS202). If the c value is smaller than 4 (Yes at step S202), the parallelcomputer system determines whether the i value is smaller than YMax(step S203). When the i value is smaller than YMax (Yes at step S203),the parallel computer system determines whether a computing node T[c][i]arranged at coordinates (c, i) is the idle node (step S204). If thecomputing node T[c][i] is the idle node (Yes at step S204), the parallelcomputer system adds 1 to each of the e and i values (step S205) andexecutes step S203.

On the other hand, if the i value is equal to or larger than YMax (No atstep S203) or when T[c][i] is not the idle node (No at step S204), theparallel computer system executes the following processing. That is, theparallel computer system outputs (d, e) as search data T[X][Y]xy[c] andsets YMax=e. Thereafter, the parallel computer system initializes the iand e values to set i=Y, e=0, and adds 1 to each of the c and d values(step S206). The parallel computer system then executes step S202. Ifthe c value is equal to or larger than 4 (No at step S202), the parallelcomputer system finishes the Y-axis fixed search processing.

Advantageous Effects of Parallel Computer System 1

As described above, the parallel computer system 1 includes the parallelcomputer 3 having the plurality of computing nodes 3 a to 3 f and themanagement device 10 managing the parallel computer 3. The computingnodes 3 a to 3 f are connected to the computing nodes 3 a to 3 f.Furthermore, the management device 10 stores therein the node table 12including first information and second information. The firstinformation indicates whether a job is assigned to the respectivecomputing nodes 3 a to 3 f. The second information indicates that a jobis constantly assigned to the virtual computing nodes arranged at thetermination ends of the connection relations of the computing nodes 3 ato 3 f.

The management device 10 searches all the regions in which the idlenodes are continuous, using the node table 12. Thereafter, themanagement device 10 specifies a region appropriate for assignment of ajob as an assignment target from the search regions and assigns the jobas the assignment target to the specified region. This enables theparallel computer system 1 to eliminate termination end determinationprocessing when the regions in which the idle nodes are continuous aresearched. As a result, the parallel computer system 1 can reduce theprocessing cost when searching the regions in which the idle nodes arecontinuous and shorten the time taken for the search.

The management device 10 selects the computing node at the base point ofthe region and counts the number of continuous idle nodes from theselected computing node in the predetermined axial direction (forexample, X axial direction) while changing the number of computing nodescontinuous in the axial direction (for example, Y axial direction) otherthan the predetermined axial direction. Thereafter, the managementdevice 10 searches all the regions in which the selected computing nodeis set to the base point using the counted result. With thisconfiguration, the management device 10 can search all the regions inwhich the idle nodes are continuous.

When the management device 10 changes the number of computing nodescontinuous in the axial direction other than the predetermined axialdirection and counts the number of idle nodes continuous in thepredetermined axial direction, the management device 10 sets the minimumvalue of the number of continuous idle nodes counted before to themaximum value of the number of idle nodes to be counted newly. Thisenables the management device 10 to eliminate the processing ofdetermining whether the computing node is the idle node for thecomputing nodes that are not included in the region, thereby shorteningthe time taken for the search.

[b] Second Embodiment

The following second embodiment describes a parallel computer system 1 athat further reduces the processing cost when the regions in which idlenodes are included continuously are searched. In the followingdescription, the same reference numerals denote components exhibitingthe same functions as those in the first embodiment described above anddescription thereof is omitted below.

FIG. 9 is a diagram for explaining the parallel computer system in thesecond embodiment. As illustrated in FIG. 9, the parallel computersystem 1 a includes the input device 2, the output device 4, theparallel computer 3, and a management device 10 a. The management device10 a includes the storage unit 11 storing therein the node table 12, thegenerator 13, the receiver 14, a search unit 15 a, the specifying unit16, and the assignment unit 17.

The search unit 15 a searches regions in which the idle nodes arecontinuous as in the search unit 15. The search unit 15 a executesselection processing of selecting a computing node and calculationprocessing of calculating a region in which the computing node selectedby the selection processing is set to the base point for the respectiveaxial directions in order to reduce the processing cost when the searchprocessing is executed.

First, the selection processing that is executed by the search unit 15 ais described. The search unit 15 a specifies a computing node of whichthe connection distance from the computing node at the origin is themaximum, that is, the computing node of which the connection distancesof the arranged coordinates in the respective axial directions are themaximum. Thereafter, the search unit 15 a sequentially selects computingnodes that are connected at the negative side in the predetermined axialdirection, that is, at the side of the computing node at the origin fromthe specified computing node.

After the search unit 15 a selects all the computing nodes that areconnected at the negative side in the predetermined axial direction fromthe specified computing node, the search unit 15 a specifies a computingnode that is connected to the specified computing node at the negativeside in the axial direction other than the predetermined axialdirection. The search unit 15 a also selects all computing nodes thatare connected at the negative side in the predetermined axial directionfrom the specified computing node. The search unit 15 a repeats theabove-mentioned selection processing for the respective axialdirections. With this configuration, the search unit 15 a selects allthe nodes from the computing node of which the connection distances ofthe coordinates in the respective axial directions are maximum to thecomputing node arranged at the origin one by one.

For example, when the search unit 15 a executes the selection processingfor the X axial direction, the search unit 15 a selects computing nodesfrom the computing node arranged at the coordinates (3, 2) to thecomputing node arranged at the coordinates (0, 2) sequentially. Afterthe search unit 15 a selects the computing nodes from the computing nodearranged at the coordinates (3, 2) to the computing node arranged at thecoordinates (0, 2) sequentially, the search unit 15 a selects computingnodes from the computing node arranged at the coordinates (3, 1) to thecomputing node arranged at the coordinates (0, 1) sequentially. Afterthe search unit 15 a selects the computing nodes from the computing nodearranged at the coordinates (3, 1) to the computing node arranged at thecoordinates (0, 1) sequentially, the search unit 15 a selects computingnodes from the computing node arranged at the coordinates (3, 0) to thecomputing node arranged at the coordinates (0, 0) sequentially.

When the search unit 15 a executes the selection processing for the Yaxial direction, the search unit 15 a selects computing nodes from thecomputing node arranged at the coordinates (3, 2) to the computing nodearranged at the coordinates (3, 0) sequentially. Subsequently, thesearch unit 15 a selects computing nodes from the computing nodearranged at the coordinates (2, 2) to the computing node arranged at thecoordinates (2, 0) sequentially, and then, selects computing nodes fromthe computing node arranged at the coordinates (1, 2) to the computingnode arranged at the coordinates (1, 0) sequentially. Thereafter, thesearch unit 15 a selects computing nodes from the computing nodearranged at the coordinates (0, 2) to the computing node arranged at thecoordinates (0, 0) sequentially.

Next, the calculation processing that is executed by the search unit 15a for the respective axial directions is described. First, the searchunit 15 a determines whether a job is assigned to the computing nodeselected by the selection processing using the node table 12. When nojob is assigned to the selected computing node, the search unit 15 aspecifies another computing node that is connected to the selectedcomputing node and of which the connection distance in any axialdirection is larger than that of the selected computing node.

The search unit 15 a calculates search data indicating a region in whichthe selected computing node is set to the base point from search dataindicating a region in which the specified computing node is set to thebase point. On the other hand, when the job is assigned to the selectedcomputing node, the search unit 15 a sets the number of continuous idlenodes from the computing node to “0” so as to calculate invalidatedsearch data.

For example, when the management device 10 a searches idle nodes at thepositive sides in the respective axes directions from the computing nodeat the base point, a region in which the computing node arranged at thecoordinates (2, 1) is set to the base point includes a region in whichthe coordinates (3, 1) are set to the base point and a region in whichthe coordinates (2, 2) are set to the base point. In view of this, thesearch unit 15 a selects the computing node in the order from thecomputing node of which the connection distance from the origin islarger by the above-mentioned selection processing and calculates aregion in which the selected computing node is set to the base pointfrom a search result obtained before. This reduces the processing costof the search processing.

The following describes the processing of calculating the search dataindicating the region in which the selected computing node is set to thebase point from the search data indicating the region in which thecomputing node specified by the search unit 15 a is set to the basepoint that is executed by the search unit 15 a. First, the Y-axis fixedsearch processing as one of the pieces of processing of calculating thesearch data that is executed by the search unit 15 a is described.

For example, the search unit 15 a selects a computing node at thenegative side in the X axial direction starting from the computing nodearranged at the coordinates (3, 2) sequentially. When no job is assignedto the selected computing node, the search unit 15 a sets the selectedcomputing node to the base point and searches the size of the region inthe X axial direction while changing the size thereof in the Y axialdirection. For one computing node, the size of a region in the X axialdirection of which the size in the Y axial direction is 1 is a valueobtained by adding 1 to the size of a region in the X axial direction ofwhich the size in the Y axial direction is 1 among regions in which acomputing node that is connected to the computing node at the positiveside in the X axial direction is set to the base point.

Based on this, when the search unit 15 a calculates search dataindicating a region of which the size in the Y axial direction is 1 forthe selected computing node, the search unit 15 a executes the followingprocessing. First, the search unit 15 a specifies search data indicatinga region of which the size in the Y axial direction is 1 among pieces ofsearch data indicating regions in which the computing node that isconnected to the selected computing node at the positive side in the Xaxial direction is set to the base point. Thereafter, the search unit 15a outputs a value obtained by adding 1 to the size of the specifiedsearch data in the X axial direction as the search data indicating theregion in which the selected computing node is set to the base point andof which the size in the Y axial direction is 1.

Furthermore, for one computing node, the size of a region in the X axialdirection of which the size in the Y axial direction is an integer n ofequal to or larger than 2 satisfies the following conditions. First, thesize of the region in the X axial direction is equal to or smaller thana value (hereinafter, referred to as a first value) obtained by adding 1to the size of a region in the X axial direction of which the size inthe Y axial direction is n among regions in which a computing node thatis connected to the computing node at the base point at the positiveside in the X axial direction is set to the base point. Moreover, thesize of the region in the X axial direction is equal to or smaller thana value (hereinafter, referred to as a second value) of the size of aregion in the X axial direction of which the size in the Y axialdirection is n−1 among regions in which a computing node that isconnected to the computing node at the base point at the positive sidein the Y axial direction is set to the base point. In consideration ofthis, the search unit 15 a selects a smaller value from the first valueand the second value. Thereafter, the search unit 15 a outputs searchdata of which the size in the Y axial direction is n and size in the Xaxial direction is the selected value.

Subsequently, the X-axis fixed search processing as one of the pieces ofprocessing of calculating the search data that is executed by the searchunit 15 a is described. For example, the search unit 15 a selects acomputing node at the negative side in the Y axial direction startingfrom the computing node arranged at the coordinates (3, 2) sequentially.When no job is assigned to the selected computing node, the search unit15 a sets the selected computing node to the base point and searches thesize of the region in the Y axial direction while changing the sizethereof in the X axial direction.

For one computing node, the size of a region in the Y axial direction ofwhich the size in the X axial direction is 1 is a value obtained byadding 1 to the size of a region in the Y axial direction of which thesize in the X axial direction is 1 among regions in which a computingnode that is connected to the computing node at the positive side in theY axial direction is set to the base point. Based on this, the searchunit 15 a specifies search data indicating a region of which the size inthe X axial direction is 1 among pieces of search data indicatingregions in which a computing node that is connected to the selectedcomputing node at the positive side in the Y axial direction is set tothe base point. The search unit 15 a then outputs a value obtained byadding 1 to the size of the specified search data in the Y axialdirection as the search data indicating the region in which the selectedcomputing node is set to the base point and of which the size in the Xaxial direction is 1.

Furthermore, for one computing node, the size of a region in the Y axialdirection of which the size in the X axial direction is an integer n ofequal to or larger than 2 satisfies the following conditions. First, thesize of the region in the Y axial direction is equal to or smaller thana value (hereinafter, referred to as a third value) of the size of aregion in the Y axial direction of which the size in the X axialdirection is n−1 among regions in which a computing node that isconnected to the computing node at the base point at the positive sidein the X axial direction is set to the base point. Moreover, the size ofthe region in the Y axial direction is equal to or smaller than a value(hereinafter, referred to as a fourth value) obtained by adding 1 to thesize of a region in the Y axial direction of which the size in the Xaxial direction is n among regions in which a computing node that isconnected to the computing node at the base point at the positive sidein the Y axial direction is set to the base point. In consideration ofthis, the search unit 15 a selects a smaller value from the third valueand the fourth value. The search unit 15 a then outputs search data ofwhich the size in the X axial direction is n and size in the Y axialdirection is the selected value.

Hereinafter, an example of the processing that is executed by the searchunit 15 a is described with reference to FIG. 10 and FIG. 11. First, anexample of the calculation processing that is executed for the X axialdirection by the search unit 15 a is described with reference to FIG.10. FIG. 10 is a view for explaining the procedure of the processingthat is executed for the X axial direction by the management device inthe second embodiment. FIG. 10 illustrates an example where the searchunit 15 a calculates search data indicating a region in which thecomputing node arranged at the coordinates (0, 0) is set to the basepoint.

For example, when the search unit 15 a searches search data T[0][0],yx[0] indicating a region of which the size in the Y axial direction is“1” among regions in which the computing node arranged at thecoordinates (0, 0) is set to the base point, the search unit 15 aexecutes the following processing. First, the search unit 15 a refers toa value of search data T[1][0], yx[0] indicating a region of which thesize in the Y axial direction is “1” among pieces of search dataindicating regions in which a computing node arranged at coordinates (1,0) is set to the base point. Thereafter, as indicated by (Q) in FIG. 10,the search unit 15 a sets a value obtained by adding 1 to the size ofthe region indicated by the search data T[1][0], yx[0] in the X axialdirection to the size of the region indicated by the search dataT[0][0], yx[0] in the X axial direction.

For example, when the search unit 15 a calculates search data T[0][0],yx[2] indicating a region of which the size in the Y axial direction is“3” among the regions in which the computing node arranged at thecoordinates (0, 0) is set to the base point, the search unit 15 aexecutes the following processing. First, as indicated by (R) in FIG.10, the search unit 15 a refers to search data T[1][0], yx[2] indicatinga region of which the size in the Y axial direction is “3” among piecesof search data indicating the regions in which the computing nodearranged at the coordinates (1, 0) is set to the base point. Thereafter,the search unit 15 a acquires, as the first value, a value obtained byadding 1 to the size of the region indicated by the search data T[1][0],yx[2] in the X axial direction.

In addition, as indicated by (S) in FIG. 10, the search unit 15 a refersto search data T[0][1], yx[2] indicating a region of which the size inthe Y axial direction is “2” among pieces of search data of regions inwhich the computing node arranged at coordinates (0, 1) is set to thebase point. Thereafter, the search unit 15 a acquires, as the secondvalue, the size of the region indicated by the search data search dataT[0][1], yx[2] in the X axial direction. Thereafter, the search unit 15a selects a smaller value from the first value and the second value thathave been acquired and sets the selected value to the size of the regionindicated by the search data T[0][0], yx[2] in the X axial direction.

Next, an example of the calculation processing that is executed for theY axial direction by the search unit 15 a is described with reference toFIG. 11. FIG. 11 is a view for explaining the procedure of theprocessing that is executed for the Y axial direction by the managementdevice in the second embodiment. FIG. 11 illustrates an example wherethe search unit 15 a calculates search data of a region in which thecomputing node arranged at the coordinates (0, 0) is set to the basepoint.

For example, when the search unit 15 a searches search data T[0][0],xy[0] indicating a region of which the size in the X axial direction is“1” among regions in which the computing node arranged at thecoordinates (0, 0) is set to the base point, the search unit 15 aexecutes the following processing. First, the search unit 15 a refers toa value of search data T[0][1], xy[0] indicating a region of which thesize in the X axial direction is “1” among pieces of search dataindicating regions in which the computing node arranged at thecoordinates (0, 1) is set to the base point. Thereafter, as indicated by(T) in FIG. 11, the search unit 15 a sets a value obtained by adding 1to the size of the region indicated by the search data T[0][1], xy[0] inthe Y axial direction to the size of the region indicated by the searchdata T[0][0], xy[0] in the Y axial direction.

For example, when the search unit 15 a calculates search data T[0][0],xy[3] indicating a region of which the size in the X axial direction is“4” among the regions in which the computing node arranged at thecoordinates (0, 0) is set to the base point, the search unit 15 aexecutes the following processing. First, as indicated by (U) in FIG.11, the search unit 15 a refers to search data T[1][0], xy[3] indicatinga region of which the size in the X axial direction is “3” among piecesof search data indicating regions in which the computing node arrangedat the coordinates (1, 0) is set to the base point. Thereafter, thesearch unit 15 a acquires, as the third value, the size of the regionindicated by the search data T[1][0], xy[3] in the Y axial direction.

In addition, as indicated by (V) in FIG. 11, the search unit 15 a refersto search data T[0][1], xy[3] indicating a region of which the size inthe X axial direction is “4” among pieces of search data indicatingregions in which the computing node arranged at the coordinates (0, 1)is set to the base point. Thereafter, the search unit 15 a acquires, asthe fourth value, the value obtained by adding 1 to the size of theregion indicated by the search data T[0][1], xy[3] in the Y axialdirection. Thereafter, the search unit 15 a selects a smaller value fromthe third value and the fourth value that have been acquired and setsthe selected value to the size of the region indicated by the searchdata T[0][0], xy[3] in the Y axial direction.

As described above, the search unit 15 a selects the computing node asthe search processing target, and generates the search data indicatingthe region in which the selected computing node is set to the base pointfrom the search data indicating the region in which the computing nodethat is connected to the selected computing node in any axial directionis set to be base point. With this configuration, the search unit 15 acan generate pieces of search data indicating regions in which therespective computing nodes are set to the base points simply bydetermining whether the respective computing nodes are the idle nodeswithout counting the number of continuous idle nodes in the respectiveaxial directions while the respective computing nodes are set to thebase points. As a result, the search unit 15 a reduces the processingcost of the search processing, thereby shortening the time taken for thesearch processing.

Next, advantageous effects by management device 10 a are described withreference to FIG. 12 and FIG. 13. First, an example of the number oftimes of determination that is executed in the processing of searchingfor regions in which the idle nodes are continuous by the relatedparallel computer is described with reference to FIG. 12. FIG. 12 is agraph for explaining the example of the number of times of conditiondetermination that is executed by the related parallel computer system.

In FIG. 12, the number of times of condition determination in each ofthe pieces of processing as illustrated in FIG. 29 and FIG. 31 isplotted while the horizontal axis is set to the number of computingnodes and the vertical axis is set to the number of times of conditiondetermination. In FIG. 12, the number of times of conditiondetermination in the main processing as illustrated in FIG. 29 isindicated by a dashed line, the number of times of conditiondetermination in the Y-axis fixing determination processing asillustrated in FIG. 30 is indicated by an alternate long and short dashline, and the number of times of condition determination in the X-axisfixing determination processing as illustrated in FIG. 31 is indicatedby a dotted line relative to the number of computing nodes. Furthermore,in FIG. 12, the total of the number of times of the pieces of conditiondetermination processing is indicated by a solid line.

For example, as illustrated in FIG. 12, the related parallel computersystem executes the condition determination processing by approximately2500 times when the number of computing nodes is “24”. Furthermore, whenthe number of computing nodes is “432”, the parallel computer systemexecutes the condition determination processing by approximately“330000” times. In this manner, in the related parallel computer, whenthe number of computing nodes becomes 18-fold, the number of executiontimes of the condition determination processing becomes approximately130-fold.

FIG. 13 is a graph for explaining an example of the number of times ofcondition determination that is executed by the management device in thesecond embodiment. In FIG. 13, the number of times of conditiondetermination that is executed by the management device 10 a is plottedwhile the horizontal axis is set to the number of computing nodes andthe vertical axis is set to the number of times of conditiondetermination in the same manner as FIG. 12. Furthermore, in FIG. 13,the number of times of condition determination in the main processing ofselecting the computing node at the base point is indicated by a dashedline, the number of times of condition determination in the Y-axisfixing determination processing is indicated by an alternate long andshort dash line, the number of times of condition determination in theX-axis fixing determination processing is indicated by a dotted line,and the total of the number of times of the pieces of conditiondetermination processing is indicated by a solid line.

For example, as illustrated in FIG. 13, the management device 10 aexecutes the condition determination processing by approximately “950”times when the number of computing nodes is “24”. Furthermore, when thenumber of computing nodes is “432”, the management device 10 a executesthe condition determination processing by approximately “30000” times.In this manner, the management device 10 a can search the regions inwhich the idle nodes are continuous by approximately 1/12 processing incomparison with the related parallel computer system.

Next, the procedure of the processing that is executed by the managementdevice 10 a is described with reference to FIGS. 14 to 16. First, theprocedure of the main processing that is executed by the managementdevice 10 a is described with reference to FIG. 14. FIG. 14 is aflowchart for explaining the procedure of the main processing that isexecuted by the management device in the second embodiment. For example,the management device 10 a initializes the Y value to “2” (step S301)and determines whether the Y value is equal to or larger than 0 (stepS302). If the Y value is equal to or larger than 0 (Yes at step S302),the management device 10 a initializes the X value to “3” (step S303)and determines whether the X value is equal to or larger than 0 (stepS304).

If the X value is equal to or larger than 0 (Yes at step S304), themanagement device 10 a executes the Y-axis fixed search processing whilesetting the X and Y values as arguments (step S305), and then, executesthe X-axis fixed search processing while setting the X and Y values asarguments (step S306). Thereafter, the management device 10 a subtracts1 from the X value (step S307) and executes step S304. On the otherhand, if the X value is smaller than 0 (No at step S304), the managementdevice 10 a subtracts 1 from the Y value (step S308) and executes stepS302. If the Y value becomes smaller than 0 (No at step S302), themanagement device 10 a finishes the processing.

Next, the procedure of the Y-axis fixed search processing that isexecuted by the management device 10 a is described with reference toFIG. 15. FIG. 15 is a flowchart for explaining the procedure of theY-axis fixed search processing that is executed by the management devicein the second embodiment. The processing as illustrated in FIG. 15corresponds to the processing at step S305 in FIG. 14. In the followingdescription, the size of a region in the X axial direction that issearched as a result of execution of the Y-axis fixed search processingwhile the size in the Y axial direction is set to “c−1” among regions inwhich a computing node arranged at coordinates (X, Y) is set to the basepoint is expressed as T[X][Y].yx[c].d.

First, the management device 10 a initializes values of the variables c,e, and d to set c=2, e=3−Y, and d=0 (step S401). The management device10 a then determines whether the c value is larger than the Y value(step S402). If it is determined that the c value is larger than the Yvalue (Yes at step S402), the management device 10 a determines whetherthe computing node T[X][Y] arranged at the coordinates (X, Y) is theidle node (step S403).

If it is determined that the computing node T[X][Y] arranged at thecoordinates (X, Y) is the idle node (Yes at step S403), the managementdevice 10 a executes the following processing. That is, the managementdevice 10 a determines whether a value of T[X][Y+1].yx[c].d (secondvalue) is smaller than a value of T[X+1][Y].yx[c].d+1 (first value)(step S404).

If it is determined that the second value is equal to or larger than thefirst value (No at step S404), the management device 10 a sets the dvalue to the first value (step S405). On the other hand, if it isdetermined that the second value is smaller than the first value (Yes atstep S404), the management device 10 a sets the d value to the secondvalue (step S406).

Subsequently, the management device 10 a outputs T[X][Y].yx[c]=(d, e) asdata indicating the region in which the computing node arranged at thecoordinates (X, Y) is set to the base point, subtracts 1 from each ofthe c and e values, and initializes the d value to 0 (step S407). Themanagement device 10 a then executes step S402 again. If it isdetermined that the computing node T[X][Y] is not the idle node (No atstep S403), the management device 10 a initializes the d value to 0(step S408) and executes step S407.

If it is determined that the c value is equal to or smaller than the Yvalue (No at step S402), the management device 10 a determines whetherthe computing node T[X][Y] is the idle node (step S409). If it isdetermined that the computing node T[X][Y] is the idle node (Yes at stepS409), the management device 10 a sets the d value toT[X+1][Y].yx[c].d+1 (step S410). On the other hand, if it is determinedthat the computing node T[X][Y] is not the idle node (No at step S409),the management device 10 a skips step S410. Thereafter, the managementdevice 10 a outputs T[X][Y].yx[c]=(d, e) (step S411) and finishes theprocessing.

Next, the procedure of the X-axis fixed search processing that isexecuted by the management device 10 a is described with reference toFIG. 16. FIG. 16 is a flowchart for explaining the procedure of theX-axis fixed search processing that is executed by the management devicein the second embodiment. The processing as illustrated in FIG. 16corresponds to the processing at step S306 in FIG. 14. In the followingdescription, the size of a region in the Y axial direction that issearched as a result of execution of the X-axis fixed search processingwhile the size in the X axial direction is set to “c−1” among regions inwhich the computing node arranged at the coordinates (X, Y) is set tothe base point is expressed as T[X][Y].xy[c].e.

First, the management device 10 a initializes values of the variables c,d, and e to set c=3, d=4−X, and e=0 (step S501). The management device10 a then determines whether the c value is larger than the X value(step S502). If it is determined that the c value is larger than the Xvalue (Yes at step S502), the management device 10 a determines whetherthe computing node T[X][Y] arranged at the coordinates (X, Y) is theidle node (step S503).

If it is determined that the computing node T[X][Y] arranged at thecoordinates (X, Y) is the idle node (Yes at step S503), the managementdevice 10 a executes the following processing. That is, the managementdevice 10 a determines whether a value of T[X+1][Y].xy[c].e (thirdvalue) is smaller than a value of T[X][Y+1].xy[c].e+1 (fourth value)(step S504).

If it is determined that the third value is equal to or larger than thefourth value (No at step S504), the management device 10 a sets the evalue to the fourth value (step S505). On the other hand, if it isdetermined that the third value is smaller than the fourth value (Yes atstep S504), the management device 10 a sets the e value to the thirdvalue (step S506).

Subsequently, the management device 10 a outputs T[X][Y].xy[c]=(d, e) asdata indicating the region in which the computing node arranged at thecoordinates (X, Y) is set to the base point, subtracts 1 from each ofthe c and e values, and initializes the e value to 0 (step S507). Themanagement device 10 a then executes step S502 again. If it isdetermined that the computing node T[X][Y] is not the idle node (No atstep S503), the management device 10 a initializes the e value to 0(step S508) and executes step S507.

If it is determined that the c value is equal to or smaller than the Xvalue (No at step S502), the management device 10 a determines whetherthe computing node T[X][Y] is the idle node (step S509). If it isdetermined that the computing node T[X][Y] is the idle node (Yes at stepS509), the management device 10 a sets the e value toT[X][Y+1].xy[c].e+1 (step S510). On the other hand, if it is determinedthat the computing node T[X][Y] is not the idle node (No at step S509),the management device 10 a skips step S510. Thereafter, the managementdevice 10 a outputs T[X][Y].xy[c]=(d, e) (step S511) and finishes theprocessing.

Advantageous Effects of Parallel Computer System 1 a

As described above, the management device 10 a executes the selectionprocessing of selecting the computing node at the negative side in thepredetermined axial direction in the order from the computing node ofwhich the connection distance from the computing node at the origin isthe maximum while changing the connection distance in the axialdirection other than the predetermined axial direction. Furthermore, themanagement device 10 a determines whether the job is assigned to each ofthe selected computing nodes.

If it is determined that no job is assigned to the selected computingnode, the management device 10 a executes the following processing. Thatis, the management device 10 a refers to a search result of a region inwhich another computing node that is connected to the selected computingnode and of which the connection distance from the origin in any axialdirection is larger than that of the selected computing node is set tothe base point. Thereafter, the management device 10 a searches for aregion in which the selected computing node is set to the base pointusing the referred search result.

With this configuration, the management device 10 a can calculate allpieces of search data indicating regions in which the selected computingnode is set to the base point without counting the number of idle nodescontinuous in the respective axial directions while the selected node isset to the base point. As a result, the management device 10 a reducesthe processing cost of the search processing, thereby shortening thetime taken for the search processing.

The management device 10 a needs not store therein the node table 12including the first information indicating whether the job is assignedto the respective computing nodes and the second information indicatingthat the job is assigned to the virtual computing nodes. That is to say,the management device 10 a may determine whether the selected node isthe node at the termination end as in the related manner withoutincluding the second information indicating that the job is assigned tothe virtual nodes in the node table 12. Even when the processing isexecuted, the management device 10 a can reduce the processing cost whensearching the regions in which the idle nodes are continuous, therebyshortening the time taken for the search processing.

When the node table 12 includes the second information indicating thatthe job is assigned to the virtual nodes, the management device 10 a caneliminate the processing of determining whether the selected node is thenode at the termination end. As a result, the management device 10 a canfurther shorten the time taken for the search processing.

When the management device 10 a searches for a region of which the sizein the first axial direction is 1 among the regions in which theselected computing node is set to the base point, the management device10 a specifies a computing node that is connected to the selectedcomputing node in the second axial direction. Furthermore, the searchunit 15 a calculates a value obtained by adding 1 to the size of aregion in the second axial direction that is indicated by search dataindicating the region of which the size in the first axial direction is1 among pieces of search data in which the specified computing node isset to the base point.

The search unit 15 a outputs search data in which the calculated valueis set to the size of the region in the second axial direction of whichthe size in the first axial direction is 1 among the regions in whichthe selected computing node is set to the base point. With thisconfiguration, when the search unit 15 a searches for the region ofwhich the size in the first axial direction is 1, the search unit 15 acan calculate the search data simply by performing addition processingwithout executing the processing of determining whether anothercomputing node is the idle node.

When the search unit 15 a searches for a region of which the connectiondistance in the first axial direction is equal to or larger than 2 amongthe regions in which the selected computing node is set to the basepoint, the search unit 15 a executes the following processing. First,the search unit 15 a specifies a region of which the connection distancein the first axial direction is the same as the connection distance ofthe region as the search target in the first axial direction amongregions in which the computing node that is connected to the selectedcomputing node in the second axial direction is set to the base point.Thereafter, the search unit 15 a acquires the connection distance of thespecified region in the second axial direction, for example, the secondvalue.

Furthermore, the search unit 15 a specifies a region of which theconnection distance in the first axial direction is a value obtained bysubtracting 1 from the connection distance of the region as the searchtarget in the first axial direction among regions in which a computingnode that is connected to the selected computing node in the first axialdirection is set to the base point. Thereafter, the search unit 15 aacquires the connection distance of the specified region in the secondaxial direction, for example, the first value. Thereafter, the searchunit 15 a sets a smaller value from the first value and the second valueto the connection distance of the region as the search target in thesecond axial direction. With this configuration, when the search unit 15a searches for a region of which the size in the first axial directionis 2, the search unit 15 a can calculate the search data simply byexecuting processing of comparing the first value and the second value.

[c] Third Embodiment

In the first and the second embodiments described above, an example inwhich the parallel computer 3 includes the computing nodes 3 a to 3 fforming the two-dimensional mesh network has been described. Theembodiment is, however, not limited thereto.

For example, the management device 10 or 10 a has a torus network inwhich the computing nodes 3 a to 3 f are connected in a circular-ringform in the X axial direction in some cases. In this case, it isdifficult for the management device 10 or 10 a to search a region comingaround in the circular-ring direction appropriately simply by executingthe above-mentioned processing.

The management device 10 or 10 a sets the respective computing nodesfrom the computing node arranged at the coordinates (0, 0) to thecomputing node arranged at the coordinates (3, 0) to the virtualorigins. Thereafter, the management device 10 or 10 a executes the mainprocessing, the X-axis fixed search processing, and the Y-axis fixedsearch processing as described above for the respective virtual origins.As a result, the management device 10 or 10 a can calculate search datain consideration of regions over the torus.

When the processing is executed, the management device 10 or 10 aexecutes the main processing, the X-axis fixed search processing, andthe Y-axis fixed search processing as described above for the respectivevirtual origins, resulting in an increase in the time taken for thesearch processing. To address this, a parallel computer system 1 b inthe third embodiment generates node tables for the respective virtualorigins. Thereafter, the parallel computer system 1 b executes thepieces of search processing using the node tables generated for therespective virtual origins in parallel so as to shorten time whencalculating pieces of search data in consideration of the regions overthe torus is calculated.

Hereinafter, the parallel computer system 1 b in the third embodiment isdescribed with reference to FIG. 17. FIG. 17 is a diagram for explainingthe parallel computer system in the third embodiment. In the followingexplanation, the same reference numerals denote the componentsexhibiting the same functions as those in the first or the secondembodiment described above and description thereof is omitted below.

As illustrated in FIG. 17, the parallel computer system 1 b includes theinput device 2, the parallel computer 3, the output device 4, and amanagement device 10 b. The management device 10 b includes a storageunit 11 a storing therein a plurality of node tables 12 a and 12 b, agenerator 13 a, the receiver 14, a plurality of search units 15 b to 15d, a specifying unit 16 a, and the assignment unit 17. It is noted thatthe storage unit 11 a stores a plurality of node tables additionally.

The parallel computer 3 includes the plurality of computing nodes 3 a to3 f as in the parallel computer 3 in the above-mentioned embodiments.The computing nodes 3 a to 3 f included in the parallel computer 3 forma torus network in which they are connected in a circular ring form inthe X axial direction or the Y axial direction or any combinationthereof.

The node tables 12 a and 12 b are node tables storing therein virtualcoordinates of the respective computing nodes and valid bits indicatingwhether a job is assigned to the respective computing nodes in acorrespondence manner when setting the different computing nodes to thevirtual origins. For example, the node table 12 a is the node table whenthe computing node 3 a is set to the virtual origin and the node table12 b is the node table when the virtual node 3 b is set to the virtualorigin.

The generator 13 a generates the node tables storing therein thecoordinates of the respective computing nodes and the valid bitsindicating whether the job is assigned to the respective computing nodesin a correspondence manner as in the generator 13.

Furthermore, when the computing nodes 3 a to 3 f form a two-dimensionaltorus network in which they are connected in a circular ring form in anyone of the X axial direction and the Y axial direction, the generator 13a generates a plurality of node tables in which the respective computingnodes connected in the circular ring form are set to the virtualorigins. The following describes processing of generating the pluralityof node tables that is executed by the generator 13 a with reference toFIG. 18.

FIG. 18 is a view for explaining examples of the virtual origins. Forexample, when the computing nodes 3 a to 3 f are connected in a circularring form in the X axial direction, as indicated by (W) in FIG. 18, thegenerator 13 a generates node tables in which the respective computingnodes arranged at the coordinates (0, 0) to the coordinates (3, 0) areset to the virtual origins. In this case, the generator 13 a generatesthe node tables in consideration of coming-around in the X axialdirection.

As is described in detail, when the computing node arranged at thecoordinates (1, 0) is set to the virtual origin, the generator 13 agenerates a node table while the computing node arranged at thecoordinates (0, 0) is considered as a computing node arranged at virtualcoordinates (3, 0). When the computing node arranged at the coordinates(2, 0) is considered as the virtual origin, the generator 13 a generatesa node table while the computing nodes arranged at the coordinates (0,0) and the coordinates (1, 0) are considered as computing nodes arrangedat virtual coordinates (2, 0) and (3, 0), respectively. Furthermore,when the computing node arranged at the coordinates (3, 0) is set to thevirtual origin, the generator 13 a generates a node table while thecomputing nodes arranged at the coordinates (0, 0) to (2, 0) areconsidered as computing nodes arranged at virtual coordinates (1, 0) to(3, 0), respectively.

For example, when the computing nodes 3 a to 3 f are connected in acircular ring form in the Y axial direction, as indicated by (X) in FIG.18, the generator 13 a generates node tables in which the respectivecomputing nodes arranged at the coordinates (0, 0) to the coordinates(0, 2) are set to the virtual origins. In this case, the generator 13 agenerates the node tables in consideration of coming-around in the Yaxial direction.

As is described in detail, when the computing node arranged at thecoordinates (0, 1) is set to the virtual origin, the generator 13 agenerates a node table while the computing node arranged at thecoordinates (0, 0) is considered as a computing node arranged at virtualcoordinates (0, 2). When the computing node arranged at the coordinates(0, 2) is set to the virtual origin, the generator 13 a generates a nodetable while the computing nodes arranged at the coordinates (0, 0) andthe coordinates (0, 1) are considered as computing nodes arranged atvirtual coordinates (0, 1) and (0, 2), respectively.

When the computing nodes 3 a to 3 f included in the parallel computer 3form a three-dimensional torus network in which they are connected in acircular ring form in the X axial direction and the Y axial direction,the generator 13 a generates a plurality of node tables in which all thecomputing nodes 3 a to 3 f are set to the virtual origins. Also in thiscase, the generator 13 a generates node tables in which coordinates ofcomputing node other than the computing nodes as the virtual origins areset in consideration of coming-around in the respective axialdirections.

Returning back to FIG. 17, the search units 15 b to 15 d execute thepieces of search processing in parallel using the different node tables.Thereafter, the search units 15 b to 15 d generate pieces of search datawhile the different computing nodes are set to the virtual origins, andoutput the pieces of generated search data to the specifying unit 16.

For example, FIG. 19 is a view for explaining the processing that isexecuted by the management device in the third embodiment. FIG. 19illustrates an example of the processing that is executed by themanagement device 10 b when the computing nodes 3 a to 3 f form thetwo-dimensional torus network in which they are connected in thecircular ring form in the X axial direction. A search unit 15 e asillustrated in FIG. 19 corresponds to a search unit that is notillustrated in FIG. 17 and exhibits the same functions as those of thesearch units 15 b to 15 d.

For example, as indicated by (Y) in FIG. 19, the generator 13 agenerates a node table while the computing node arranged at thecoordinates (0, 0) is set to the virtual origin. The search unit 15 bexecutes the processing of searching for regions in which the idle nodesare continuous using the generated node table. As indicated by (Z) inFIG. 19, the generator 13 a generates a node table while the computingnode arranged at the coordinates (3, 0) is set to the virtual origin andthe coordinates of other computing nodes are modified to coordinates inconsideration of coming-around in the X axial direction. The search unit15 c executes the processing of searching for regions in which the idlenodes are continuous using the generated node table.

Furthermore, as indicated by (a) in FIG. 19, the generator 13 agenerates a node table while the computing node arranged at thecoordinates (2, 0) is set to the virtual origin and the coordinates ofother computing nodes are modified to coordinates in consideration ofcoming-around in the X axial direction. The search unit 15 d executesthe processing of searching for regions in which the idle nodes arecontinuous using the generated node table.

In addition, as indicated by (b) in FIG. 19, the generator 13 agenerates a node table while the computing node arranged at thecoordinates (1, 0) is set to the virtual origin and the coordinates ofother computing node are modified to coordinates in consideration ofcoming-around in the X axial direction. The search unit 15 e executesthe processing of searching for regions in which the idle nodes arecontinuous using the generated node table.

Thus, the management device 10 b includes the plurality of search units15 b to 15 e. When the computing nodes 3 a to 3 f form the torus networkin which they are connected in the circular ring form in the X axialdirection, the management device 10 b generates the node tables 12 a and12 b in which the respective computing nodes of which the coordinates inthe Y axial direction are “0” are set to the virtual origins.Thereafter, the management device 10 b causes the respective searchunits 15 b to 15 e to execute the pieces of processing of searching theregions in which the idle nodes are arranged continuously, using thedifferent node tables 12 a and 12 b in parallel.

As a result, also when the computing nodes 3 a to 3 f form the torusnetwork in which they are connected in the circular ring form in the Xaxial direction, the management device 10 b executes the pieces ofsearch processing for the respective virtual origins in parallel so asto shorten the time taken for the search processing.

When the pieces of search processing are executed, for example, thesearch units 15 b to 15 e output pieces of data in the format asillustrated in (N) in FIG. 5 by the number that is the same as thenumber of virtual origins, resulting in an increase in the time takenfor sorting of the pieces of search data. To address this, thespecifying unit 16 a executes the following processing.

For example, when the computing nodes 3 a to 3 f form thetwo-dimensional torus network, the pieces of search data that are outputfrom the respective search units 15 b to 15 e include data incorporatinga region indicated by another region in some cases. As the detailexample thereof is described, a plurality of pieces of search data thatare acquired when the Y-axis fixed search processing is executed arepieces of search data indicating regions of which the sizes in the Yaxial direction are decreased one by one. Furthermore, the plurality ofpieces of search data that are acquired when the X-axis fixed searchprocessing is executed are pieces of search data indicating regions ofwhich the sizes in the X axial direction are decreased one by one.

In view of this, the specifying unit 16 a compares a region indicated byfirst search data and a region indicated by search data indicating aregion of which the size in the axial direction other than thepredetermined axial direction is larger than that of the regionindicated by the first search data, that is, the search data that ishigher-order than the first search data. When the size of the regionindicated by the second search data in the predetermined axial directionis larger than the size of the region indicated by the first search datain the predetermined axial direction, the specifying unit 16 a excludesthe first search data from the search result.

To be specific, the specifying unit 16 a collects the pieces of searchdata calculated by the search units 15 b to 15 e and sorts them in thedescending order of the sizes of the region indicated by the search datain the respective axial directions. The specifying unit 16 a alsodetermines whether the region indicated by each search data includes aregion indicated by low-order search data in the order from thehighest-order search data. When the region indicated by the search dataincludes the region indicated by the low-order search data, thespecifying unit 16 a deletes the low-order search data.

FIG. 20 is a view for explaining the procedure of processing of deletingthe search data that is executed by the management device in the thirdembodiment. FIG. 20 illustrates an example of the processing of deletingunnecessary search data from the pieces of search data as illustrated inFIG. 5. For example, the specifying unit 16 a sorts all the pieces ofsearch data as illustrated in FIG. 20 in the descending order of thesize of the region indicated by the search data and determines whether aregion indicated by high-order search data includes a region indicatedby low-order search data.

As indicated by (c) in FIG. 20, the sizes of regions indicated byT[0][0], yx[0] and T[0][0], yx[1] in the X axial direction are equal toor smaller than the size of a region indicated by T[0][0], yx[2] in theX axial direction. Based on this, the specifying unit 16 a determinesthat the region indicated by T[0][0], yx[2] includes the regionsindicated by T[0][0], yx[0] and T[0][0], yx[1], and deletes T[0][0],yx[0] and T[0][0], yx[1].

Furthermore, the specifying unit 16 a executes the same processing. Withthis configuration, as indicated by (d) in FIG. 20, the specifying unit16 a excludes pieces of search data other than T[3][0], yx[2] amongpieces of search data from T[3][0], yx[0] to T[3][0], yx[2]. Thespecifying unit 16 a compares pieces of search data acquired by the Xaxial direction fixing processing, that is, pieces of search data asindicated by (e) in FIG. 20 with pieces of search data acquired by the Yaxial direction fixing processing. As a result, the specifying unit 16 adeletes all the pieces of search data as indicated by (e) in FIG. 20.

Consequently, as indicated by (f) in FIG. 20, the specifying unit 16 acan acquire pieces of search data with no waste. Thereafter, thespecifying unit 16 a specifies search data indicating a region that isoptimum for job assignment from the pieces of search data as indicatedby (f) in FIG. 20.

Next, an example of a deletion amount of the pieces of search data bydeleting pieces of low-order search data indicating regions included inregions indicated by pieces of high-order search data is described withreference to FIG. 21 and FIG. 22. FIG. 21 is a graph for explaining anexample of the number of pieces of search data that are output from therelated parallel computer system. In FIG. 21, the number of pieces ofsearch data that are output from the related parallel computer system isplotted while the horizontal axis is set to the number of computingnodes and the vertical axis is set to the number of pieces of searchdata in the same manner as FIG. 12.

For example, as illustrated in FIG. 21, the related parallel computersystem outputs “324” pieces of search data when the number of computingnodes is “24”. Furthermore, when the number of computing nodes is “432”,the parallel computer system outputs “9504” pieces of search data. Inthis manner, in the related parallel computer, when the number ofcomputing nodes becomes 18-fold, the number of pieces of search datathat are output is approximately 29-fold.

FIG. 22 is a graph for explaining an example of the number of pieces ofsearch data that are output from the management device in the thirdembodiment. In FIG. 22, the number of pieces of search data that areoutput from the management device 10 b is plotted while the horizontalaxis is set to the number of computing nodes and the vertical axis isset to the number of pieces of search data in the same manner as FIG.21. For example, as illustrated in FIG. 22, the management device 10 boutputs “24” pieces of search data when the number of computing nodes is“24”. Furthermore, when the number of computing nodes is “432”, themanagement device 10 b outputs “432” pieces of search data. As a resultof this, when the number of computing nodes is “432”, it is sufficientthat the management device 10 b searches search data indicating a regionoptimum for the job assignment from approximately 1/22 pieces of searchdata in comparison with the related parallel computer system. Thisenables the management device 10 b to shorten the time taken for the jobassignment.

Next, the number of times of condition determination processing that isexecuted by the management device 10 b is described with reference toFIG. 23 and FIG. 24. First, an example of the number of times ofcondition determination that is executed by the related parallelcomputer when torus in the X axial direction is taken into considerationis described with reference to FIG. 23. FIG. 23 is a graph forexplaining an example of the number of times of condition determinationthat is executed by the related parallel computer when the torus in theX axial direction is taken into consideration.

In FIG. 23, the number of times of condition determination that isexecuted by the related parallel computer system is plotted by a solidline while the horizontal axis is set to the number of computing nodesand the vertical axis is set to the number of times of conditiondetermination in the same manner as FIG. 12. Furthermore, in FIG. 23,the number of times of condition determination that is executed by therelated parallel computer system when the torus in the X axial directionis not taken into consideration is plotted by a dashed line forcomparison.

For example, as illustrated in FIG. 23, the related parallel computersystem executes the condition determination processing by the number oftimes obtained by integrating the number of times of conditiondetermination as illustrated in FIG. 12 and the number of computingnodes continuous in the X axial direction. As a result of this, forexample, the related parallel computer system executes the conditiondetermination processing by approximately “60552” times when the numberof computing nodes is “24”. Furthermore, when the number of computingnodes is “432”, the parallel computer system executes the conditiondetermination processing by approximately “7875384” times. In thismanner, in the related parallel computer, when the number of computingnodes becomes 18-fold, the number of execution times of the conditiondetermination processing is approximately 3121-fold.

FIG. 24 is a graph for explaining an example of the number of times ofcondition determination that is executed by the management device in thethird embodiment. In FIG. 24, the number of times of conditiondetermination that is executed by the management device 10 a is plottedwhile the horizontal axis is set to the number of computing nodes andthe vertical axis is set to the number of times of conditiondetermination in the same manner as FIG. 12. For example, as illustratedin FIG. 24, the management device 10 a executes the conditiondetermination processing by approximately “75” times when the number ofcomputing nodes is “24”. Furthermore, when the number of computing nodesis “432”, the management device 10 a executes the conditiondetermination processing by approximately “12349” times. In this manner,the management device 10 a can search the regions in which the idlenodes are continuous by approximately 1/638 processing in comparisonwith the related parallel computer system.

Next, the procedure of the processing that is executed by the managementdevice 10 b is described with reference to FIG. 25 and FIG. 26. First,the basic procedure of the processing that is executed by the managementdevice 10 b is described with reference to FIG. 25. FIG. 25 is aflowchart for explaining the procedure of the main processing that isexecuted by the management device in the third embodiment. In thefollowing description, a cell corresponding to a computing node T[X][Y]among cells in the table generated by the management device 10 b isexpressed as TT[X][Y]. In addition, in the following description, thesize of a region indicated by search data acquired as a result of theparallel processing is referred to as SZ.

First, the management device 10 b executes initial setting (step S601).As a detail example thereof is described, the management device 10 bgenerates a table indicating that five computing nodes are arranged inthe X axial direction and four computing nodes are arranged in the Yaxial direction, and all the computing nodes are set to the idle nodes.The management device 10 b stores information indicating that TT[4][0]to TT[4][3] and TT[0][3] to TT[4][3] indicating the virtual computingnodes are being used in the generated table. The management device 10 bacquires an acquisition region return pointer array P[4] for parallelprocessing.

Subsequently, the management device 10 b stores information indicatingthat the computing nodes are being used in regions corresponding to thecomputing nodes assigned with the job that are being used in thegenerated table (step S602). Thereafter, the management device 10 bexecutes four-parallel processing (step S603). Thereafter, themanagement device 10 b initializes values of X, XX, and SZ to 0 (stepS604). The management device 10 b determines whether the SZ value of thearray P[X] is larger than the present variable SZ (step S605).

If it is determined that the SZ value of the array P[X] is larger thanthe present variable SZ (Yes at step S605), the management device 10 bsets the XX value to the X value and changes the SZ value to the SZvalue of an array P[XX] (step S606). On the other hand, if it isdetermined that the SZ value of the array P[X] is equal to or smallerthan the present variable SZ (No at step S605), the management device 10b skips the processing at step S606.

Subsequently, the management device 10 b determines whether the X valueis smaller than 3 (step S607). If it is determined that the X value isequal to or larger than 3 (No at step S607), the management device 10 boutputs a T value of the array P[XX] and finishes the processing. On theother hand, if it is determined that the X value is smaller than 3 (Yesat step S607), the management device 10 b adds 1 to the X value (stepS608) and executes step S605.

Next, the procedure of four-parallel processing that is executed by themanagement device in the third embodiment is described with reference toFIG. 26. FIG. 26 is a flowchart for explaining the procedure of thefour-parallel processing that is executed by the management device inthe third embodiment. The processing as illustrated in FIG. 26corresponds to the processing at step S603 in FIG. 25. In the followingdescription, I, X, and Y are set to variables.

First, the management device 10 b executes initial setting (step S701).To be specific, the management device 10 b acquires a PP.T[5][4] regionin which five pieces of data can be aligned in the X axial direction andfour pieces of data can be aligned in the Y axial direction. Themanagement device 10 b stores information indicating that the job isassigned to the computing nodes in PP.T[4][0] to PP.T[4][3] andPP.T[0][3] to PP.T[4][3] as regions corresponding to the virtualcomputing nodes among the acquired regions. The management device 10 bacquires a PP.SZ region and initializes the P[X] value at an address inwhich the PP value is stored.

The management device 10 b initializes the variable I value to 0 (stepS702), initializes the variable Y value to 0 (step S703), and sets thePP.T[I][Y] value to TT[X][Y] (step S704). The management device 10 bdetermines whether the Y value is smaller than 2 (step S705). If the Yvalue is equal to or larger than 2 (No at step S705), the managementdevice 10 b determines whether the I value is equal to 3 (step S706).

If it is determined that the I value is different from 3 (No at stepS706), the management device 10 b adds 1 to each of the I and X values(step S707), and determines whether the X value is equal to 4 (stepS708). If it is determined that the X value is equal to 4 (Yes at stepS708), the management device 10 b sets the X value to 0 (step S709) andexecutes step S703.

On the other hand, if it is determined that the I value is equal to 3(Yes at step S706), the management device 10 b executes the searchprocessing and acquires the array PP.T value, that is, pieces of searchdata (step S710). Thereafter, the management device 10 b sorts the listof the pieces of search data acquired as a result of the searchprocessing by the number of computing nodes included in the region, andsets the PP.SZ value to the maximum number of nodes (step S711) andfinishes the processing.

On the other hand, if it is determined that the Y value is smaller than2 (Yes at step S705), the management device 10 b adds 1 to the Y value(step S712) and executes step S704. If it is determined that the X valueis different from 4 (No at step S708), the management device 10 bexecutes step S703.

Advantageous Effects by Information Processing System 1 b

As described above, the computing nodes 3 a to 3 f of the parallelcomputer 3 form a torus network in which they are connected in acircular ring form in the predetermined axial direction. The managementdevice 10 b sets the respective information processing devicescontinuous in the predetermined axial direction to the virtual origins,and searches all the regions in which the respective computing nodes 3 ato 3 f are set to the base points for the respective virtual origins.

Furthermore, the management device 10 b compares the size of the regionindicated by the first search data in the predetermined axial directionand the size of the region indicated by the second search data as thehigher-order search data than the first search data in the predeterminedaxial direction among the pieces of search data. When the size of theregion indicated by the first search data in the predetermined axialdirection is equal to or smaller than the size of the region indicatedby the second search data in the predetermined axial direction, themanagement device 10 b deletes the search data indicating the firstregion. This enables the management device 10 b to shorten the timetaken for the processing of searching a region optimum for the jobassignment.

Moreover, the management device 10 b includes the plurality of searchunits 15 b to 15 e. The management device 10 b stores the plurality ofnode tables 12 a and 12 b expressing the coordinates at which othercomputing nodes are arranged while the computing nodes continuous in thepredetermined axial direction are set to the virtual origins. Therespective search units 15 b to 15 e select different computing nodes asthe virtual origins from the computing nodes continuous in thepredetermined axial direction. Thereafter, the respective search units15 b to 15 e execute the pieces of processing of searching for regionsin which the idle nodes are arranged continuously in parallel, using thenode tables in which the selected computing nodes are set to the virtualorigins. With this configuration, even when the computing nodes 3 a to 3f of the parallel computer 3 form the torus network in which they areconnected in a circular ring form in the predetermined axial direction,the management device 10 b can shorten the time taken for the jobassignment.

[d] Fourth Embodiment

Although the embodiments of the present invention have been describedabove, the embodiment may be executed in various different modes inaddition to the above-mentioned embodiments. The following describesother embodiments encompassed in the invention as the fourth embodiment.

(1) Management Device

The functions of the management device 10, 10 a, or 10 b in each of thefirst to the third embodiments described above may be combinedarbitrarily. For example, the management device 10 b may not use thenode table indicating that the job is constantly assigned to the virtualcomputing nodes arranged at the ends of the network unlike themanagement device 10.

(2) Computing Node

Although the computing nodes 3 a to 3 f form the two-dimensional meshnetwork, the two-dimensional torus network, or the three-dimensionaltorus network in each of the first to the third embodiments describedabove, the embodiment is not limited thereto. For example, the computingnodes 3 a to 3 f may form an arbitrary-dimensional mesh network or anarbitrary-dimensional torus network.

When the computing node 3 a to 3 f form the arbitrary-dimensional meshnetwork, the management device 10 or 10 a can calculate all the piecesof search data by counting the number of continuous idle nodes in eachaxial direction while changing the number of continuous idle nodes inanother axial direction. Furthermore, the computing node 3 a to 3 f formthe arbitrary-dimensional torus network, the management device 10 bgenerates the node tables for the respective virtual origins inconsideration of coming-around in the respective axial directions. Themanagement device 10 b can calculate all the pieces of search data byexecuting the pieces of search processing in parallel using thegenerated node tables.

(3) Parallel Processing

In the above-mentioned third embodiment, the management device 10 bexecutes the pieces of search processing in parallel using the pluralityof search units 15 b to 15 e. For example, the management device 10 bgenerates the node tables by the number in accordance with the topologyof the network formed by the computing nodes 3 a to 3 f. For thisreason, the management device 10 b desirably includes the search unitsby the number that is the same as the number of node tables that aregenerated. Alternatively, for example, the management device 10 b mayinclude the search units by the half-number of the number of node tablesthat are generated and each of the search units may execute the searchprocessing two times so as to calculate all the pieces of search data.

(4) Program

A computer may execute a previously prepared control program so as toexecute the functions of the management device 10, 10 a, or 10 b asdescribed in each of the above-mentioned embodiments. The followingdescribes an example of the computer that executes the control programhaving the same functions as those of the above-mentioned managementdevice 10, 10 a, or 10 b with reference to FIG. 27. FIG. 27 is a diagramfor explaining the example of the computer that executes the controlprogram.

A computer 100 as illustrated in FIG. 27 includes a read only memory(ROM) 110, a hard disk drive (HDD) 120, a random access memory (RAM)130, and a central processing unit (CPU) 140 that are connected with abus 160. Furthermore, the computer 100 as illustrated in FIG. 27includes an input/output (I/O) 150 for communicating with the parallelcomputer 3. The I/O 150 is connected to the CPU 140 and the like withthe bus 160.

The HDD 120 previously holds a control program 121. The CPU 140 readsout and executes the control program 121 from the HDD 120, so that thecontrol program 121 functions as a control process 141 in the exampleillustrated in FIG. 27. The control process 141 exhibits the samefunctions as those of the generator 13, the receiver 14, the search unit15, the specifying unit 16, and the assignment unit 17 as illustrated inFIG. 1.

The control program described in the embodiment can be executed byexecuting a previously prepared program on a computer such as a personalcomputer and a workstation. The program can be distributed via a networksuch as the Internet. Furthermore, the program is recorded in acomputer-readable recording medium such as a hard disc, a flexible disk(FD), a compact disc read only memory (CD-ROM), a magneto optical disc(MO), and a digital versatile disc (DVD). The program can be alsoexecuted by being read from the recording medium by the computer.

The computer 100 may execute the control program 121 using an arithmeticdevice such as a microprocessor unit (MPU) and a field programmable gatearray (FPGA) instead of the CPU. In addition, the above-mentionedcontrol program 121 may be stored in the RAM 130 or the ROM 110 or maybe executed by the CPU 140 by another method. For example, each programis stored in a “mobile physical medium” such as an FD, a CD-ROM, a DVD,a magneto optical disc, and an integrated circuit (IC) card.

The computer 100 may execute the respective programs by acquiring themfrom the mobile physical medium. Alternatively, the computer 100 mayacquire and execute the respective programs stored in another computeror a server device through a public line, the Internet, a local accessnetwork (LAN), a wide area network (WAN), or the like.

According to one embodiment, the present invention can reduce theprocessing cost when regions including idle nodes are searched.

All examples and conditional language provided herein are intended forpedagogical purposes of aiding the reader in understanding the inventionand the concepts contributed by the inventor to further the art, and arenot to be construed as limitations to such specifically recited examplesand conditions, nor does the organization of such examples in thespecification relate to a showing of the superiority and inferiority ofthe invention. Although one or more embodiments of the present inventionhave been described in detail, it should be understood that the variouschanges, substitutions, and alterations could be made hereto withoutdeparting from the spirit and scope of the invention.

What is claimed is:
 1. A parallel computer system comprising: a parallelcomputing device including a plurality of information processing devicesthat are connected to form a two-dimensional mesh network, theinformation processing device arranged at an end point being set to anorigin; and a management device managing the parallel computing device,wherein the management device includes: a memory; and a processorcoupled to the memory, wherein the processor executes a processincluding: storing therein an assignment table, storing valid bits witheach valid bit indicating that a job is assigned to correspondinginformation processing device when the valid bit is on, including firstassignment information for the information processing devices on thetwo-dimensional mesh network and second assignment information forvirtual information processing devices, wherein the virtual informationprocessing devices are arranged at termination ends of thetwo-dimensional mesh network of the information processing devicesagainst information processing devices arranged on the X-axis or Y-axis,the valid bits of the second assignment information being set on;searching regions in which idle information processing devices assignedwith no job are arranged continuously, using the first assignmentinformation and the second assignment information stored in theassignment table; specifying a region appropriate for assignment of ajob as an assignment target among the regions searched by the searching;and assigning the job to information processing devices included in theregion specified by the specifying.
 2. The parallel computer systemaccording to claim 1, wherein the searching includes selecting aninformation processing device as a base point of the region, countsnumber of idle information processing devices continuous from theselected information processing device in a predetermined axialdirection while changing number of information processing devicescontinuous in an axial direction other than the predetermined axialdirection, and searching idle information processing devices based onthe counted result wherein information processing devices are searchedfrom the selected information processing device as a base point usingthe counted results as an index and the index is in some increments ofnumber of information processing devices.
 3. The parallel computersystem according to claim 2, wherein when the searching includeschanging the number of information processing devices continuous in theaxial direction other than the predetermined axial direction andcounting the number of idle information processing devices continuous inthe predetermined axial direction newly, the searching determineswhether the job is assigned to the information processing devices in thepredetermined axial direction from the selected information processingdevice as a base point and the index is incremented toward a number ofcounted results.
 4. The parallel computer system according to claim 1,wherein the process includes: executing processing of selectinginformation processing devices in an order from an informationprocessing device wherein a connection distance from an informationprocessing device as an origin is maximum toward the informationprocessing device as the origin in a predetermined axial direction whilechanging a connection distance in another axial direction; anddetermining whether a job is assigned to the information processingdevice selected at the executing, using the assignment table, and whenthe determining includes determining that no job is assigned to theselected information processing device, the searching includes searchingregions in which the selected information processing device is set to abase point, using a search result of regions in which anotherinformation processing device that is connected to the selectedinformation processing device and of which the connection distance fromthe origin in any axial direction is larger than a connection distanceof the selected information processing device is set to a base point. 5.The parallel computer system according to claim 4, wherein when thesearching includes searching for a region of which the connectiondistance in a first axial direction is 1 among the regions in which theselected information processing device is set to the base point, thesearching includes setting, to a connection distance of the region as asearch target in a second axial direction, a value obtained by adding 1to a connection distance of a region in a second axial direction ofwhich the connection distance in the first axial direction is 1 amongregions in which an information processing device connected to theselected information processing device in the second axial direction isset to a base point.
 6. The parallel computer system according to claim4, wherein when the searching includes searching for a region of whichthe connection distance in a first axial direction is equal to or largerthan 2 among the regions in which the selected information processingdevice is set to the base point, the searching includes setting, to aconnection distance of the region as a search target in a second axialdirection, a connection distance that is a smaller value between a valueobtained by adding 1 to a connection distance of a region in the secondaxial direction of which the connection distance in the first axialdirection is the same as a connection distance of the region as thesearch target in the first axial direction among regions in which aninformation processing device connected to the selected informationprocessing device in the second axial direction is set to a base pointand a value of a connection distance of a region in the second axialdirection of which the connection distance in the first axial directionis a value obtained by subtracting 1 from the connection distance of theregion as the search target in the first axial direction among regionsin which an information processing device connected to the selectedinformation processing device in the first axial direction is set to abase point.
 7. The parallel computer system according to claim 1,wherein the information processing devices form a torus network in whichthe information processing devices are connected in a circular ring formin a predetermined axial direction, the searching includes settingrespective information processing devices continuous in the predetermineaxial direction to virtual origins and searching all the regions inwhich the respective information processing devices are set to basepoints for the respective virtual origins, and when a connectiondistance of a first region in a predetermined axial direction is equalto or smaller than a connection distance of a second region in thepredetermined axial direction of which the connection distance in anaxial direction other than the predetermined axial direction is largerthan a connection distance of the first region in a search result at thesearching, the specifying includes excluding the first region from thesearch result.
 8. The parallel computer system according to claim 1,wherein the information processing devices form a torus network in whichthe information processing devices are connected in a circular ring formin a predetermined axial direction, the storing includes storing thereina plurality of assignment tables in which the respective informationprocessing devices continuous in the predetermined axial direction areset to virtual origins, and the searching includes selecting differentinformation processing devices as the virtual origins from theinformation processing devices continuous in the predetermined axialdirection, and executing pieces of processing of searching for regionsin which the idle information processing devices are arrangedcontinuously in parallel, using the assignment tables in which theselected information processing devices are set to the virtual origins.9. A non-transitory computer-readable recording medium having storedtherein a program for a management device managing a parallel computingdevice including a plurality of information processing devices that areconnected to form a two-dimensional mesh network, the informationprocessing device arranged at an end point being set to an origin, theprogram causing a computer to execute a management device controlprocess comprising: searching for regions in which idle informationprocessing devices assigned with no job are arranged continuously, usingan assignment table, storing valid bits with each valid bit indicatingthat a job is assigned to a corresponding information processing devicewhen the valid bit is on, including first assignment information for theinformation processing devices on the two-dimensional mesh network andsecond assignment information for virtual information processingdevices, wherein the virtual information processing devices are arrangedat termination ends of the two-dimensional mesh network of theinformation processing devices against information processing devicesarranged on the X-axis or Y-axis, the valid bits of the secondassignment information being set on; specifying a region appropriate forassignment of a job as an assignment target among the searched regions;and assigning the job to information processing devices included in thespecified region.
 10. A method of controlling a parallel computer systemincluding a plurality of information processing devices that areconnected to form a two-dimensional mesh network, the informationprocessing device arranged at an end point being set to an origin, themethod comprising: searching for regions in which idle informationprocessing devices assigned with no job are arranged continuously, usingan assignment table, storing valid bits with each valid bit indicatingthat a job is assigned to a corresponding information processing devicewhen the valid bit is on, including first assignment information for theinformation processing devices on the two-dimensional mesh network andsecond assignment information for virtual information processingdevices, wherein the virtual information processing devices are arrangedat termination ends of the two-dimensional mesh network of theinformation processing devices against information processing devicesarranged on the X-axis or Y-axis, the valid bits of the secondassignment information being set on; specifying a region appropriate forassignment of a job as an assignment target among the searched regions,by the processor; and assigning the job to information processingdevices included in the specified region, by the processor.